4118 search results - page 103 / 824 » Efficient Algorithms for Airline Problem |
133
Voted
NIPS
2008
15 years 4 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
104
Voted
CG
2002
Springer
15 years 3 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
127
Voted
AIPS
2008
15 years 5 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
131
click to vote
ECAI
2008
Springer
15 years 5 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 ...
151
Voted
CATS
2006
15 years 4 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...