Sökning: WFRF:(Beldiceanu Nicolas)
> (2010-2014) >
A Synchronized Swee...
A Synchronized Sweep Algorithm for the k-Dimensional Cumulative Constraint
-
- Letort, Arnaud (författare)
- INRIA, France
-
- Carlsson, Mats (författare)
- RISE,Computer Systems Laboratory
-
- Beldiceanu, Nicolas (författare)
- INRIA, France
-
(creator_code:org_t)
- 9
- Berlin, Heidelberg : Springer, 2013
- 2013
- Engelska.
-
Ingår i: CPAIOR. - Berlin, Heidelberg : Springer. ; , s. 144-159
- Relaterad länk:
-
http://link.springer...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- This paper presents a sweep based algorithm for the k-dimensional Cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks and k resources, this algorithm has a worst-case time complexity of O(kn^2) but scales well in practice. In greedy assignment mode, it handles up to 1 million tasks with 64 resources in one single constraint in SICStus. In filtering mode, on our benchmarks, it yields a speed-up of about k^(3/4) when compared to its decomposition into k independent Cumulative constraints.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Algorithms
- Artificial intelligence
- Constraint theory
- Operations research
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)