Sciweavers

169 search results - page 17 / 34
» Decentralized Search with Random Costs
Sort
View
TEC
2002
163views more  TEC 2002»
13 years 6 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 1 months ago
Hide-and-Seek with Directional Sensing
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
Alessandro Borri, Shaunak Dattaprasad Bopardikar, ...
ATAL
2009
Springer
13 years 4 months ago
Learning to Locate Trading Partners in Agent Networks
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...
John Porter, Kuheli Chakraborty, Sandip Sen
CCGRID
2009
IEEE
14 years 1 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 4 days ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf