1332 search results - page 69 / 267 » Combinatorial Algorithms |
WAE
2001
13 years 10 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
IJCAI
2001
13 years 10 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
DGCI
2009
Springer
14 years 11 days ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
HEURISTICS
2007
13 years 9 months ago
2007
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
PPSN
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...