1144 search results - page 160 / 229 » Logic programming for combinatorial problems |
116
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
117
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
138
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
127
click to vote
AIPS
2007
15 years 4 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
137
click to vote
AIPS
2007
15 years 4 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...