2899 search results - page 161 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
128
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
164
click to vote
CCGRID
2008
IEEE
16 years 18 days ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
153
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
172
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
173
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...