Sciweavers

2180 search results - page 249 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
JAIR
2008
110views more  JAIR 2008»
14 years 10 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
ALGOSENSORS
2007
Springer
15 years 4 months ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
EVOW
2000
Springer
15 years 1 months ago
Prediction of Power Requirements for High-Speed Circuits
Modern VLSI design methodologies and manufacturing technologies are making circuits increasingly fast. The quest for higher circuit performance and integration density stems from f...
Fulvio Corno, Maurizio Rebaudengo, Matteo Sonza Re...
PAAMS
2010
Springer
15 years 2 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
80
Voted
FUIN
2006
139views more  FUIN 2006»
14 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale