1480 search results - page 181 / 296 » Ants can solve constraint satisfaction problems |
193
click to vote
MP
2006
15 years 6 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
181
click to vote
SAT
2005
Springer
16 years 1 days ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
156
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
173
click to vote
ASIAMS
2007
IEEE
16 years 27 days ago
2007
IEEE
The implicit approach can be used to efficiently model realistically deformable objects for large constraints such as stiffness or time. In soft bodies with pressure forces, model...
178
click to vote
DAC
2000
ACM
15 years 11 months ago
2000
ACM
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...