16404 search results - page 883 / 3281 » A set coverage problem |
191
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
205
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider a slotted input-queued switch with a crossbar-like switching fabric. In each time-slot, a centralized scheduler determines a switching fabric configuration to transfer ...
204
click to vote
DGCI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Discrete tomography concerns the reconstruction of functions with a finite number of values from few projections. For a number of important real-world problems, this tomo...
169
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
217
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...