11740 search results - page 250 / 2348 » More Problems in Rewriting |
255
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
159
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
158
click to vote
VLSID
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
143
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
165
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...