1013 search results - page 134 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The building block hypothesis implies that the epistatic property of a given problem must be connected well to the linkage property of the employed representation and cro...
105
click to vote
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
WIOPT
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...