526 search results - page 5 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
103
Voted
CONSTRAINTS
2006
14 years 9 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
JDA
2006
14 years 9 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
64
Voted
POPL
1994
ACM
15 years 1 months ago
1994
ACM
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...