15033 search results - page 320 / 3007 » Complexity Theory and Algorithms |
145
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
155
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
180
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
183
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
266
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...