16404 search results - page 452 / 3281 » A set coverage problem |
169
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
146
click to vote
EMO
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Multi-objective evolutionary algorithms (MOEAs) have proven to be a powerful tool for global optimization purposes of deterministic problem functions. Yet, in many real-w...
186
click to vote
PPSN
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
171
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
193
click to vote
COMPGEOM
2003
ACM
16 years 1 days ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...