WFRF:(Beldiceanu Nicolas)
Search: WFRF:(Beldiceanu Nicolas) > (2010-2014) > A Synchronized Swee...
- 14 of 17
- Previous record
- Next record
- To hitlist
A Synchronized Sweep Algorithm for the k-Dimensional Cumulative Constraint
-
- Letort, Arnaud (author)
- INRIA, France
-
- Carlsson, Mats (author)
- RISE,Computer Systems Laboratory
-
- Beldiceanu, Nicolas (author)
- INRIA, France
- (creator_code:org_t)
- 9
- Berlin, Heidelberg : Springer, 2013
- 2013
- English.
- In: CPAIOR. - Berlin, Heidelberg : Springer. ; , s. 144-159
- Conference paper (peer-reviewed)
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Keyword
- Algorithms
- Artificial intelligence
- Constraint theory
- Operations research
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database
- 14 of 17
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Letort, Arnaud
- Carlsson, Mats
- Beldiceanu, Nico ...
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- Articles in the publication
- CPAIOR
- By the university
- RISE
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
