Sciweavers

1480 search results - page 75 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ASP
2005
Springer
15 years 3 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
VDB
1998
275views Database» more  VDB 1998»
14 years 11 months ago
Building Metaphors for Supporting User Interaction with Multimedia Databases
In this paper we discuss how metaphors for supporting user interaction with multimedia databases can be automatically generated. The work presented is a further step in the develo...
Maria Francesca Costabile, Donato Malerba, Matthia...
AAI
2006
106views more  AAI 2006»
14 years 9 months ago
Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
Edmund K. Burke, Patrick De Causmaecker, Sanja Pet...
ENVSOFT
2007
258views more  ENVSOFT 2007»
14 years 9 months ago
Optimal groundwater monitoring design using an ant colony optimization paradigm
Groundwater long-term monitoring (LTM) is required to assess the performance of groundwater remediation and human being health risk at post-closure sites where groundwater contami...
Yuanhai Li, Amy B. Chan Hilton
APWEB
2003
Springer
15 years 3 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...