Sciweavers

15033 search results - page 61 / 3007
» Complexity Theory and Algorithms
Sort
View
ATAL
2003
Springer
15 years 11 months ago
A decision making procedure for collaborative planning
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
Timothy W. Rauenbusch, Barbara J. Grosz
ATAL
2006
Springer
15 years 10 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
CORR
2011
Springer
205views Education» more  CORR 2011»
15 years 18 days ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 23 days ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 11 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman