Sciweavers

159 search results - page 29 / 32
» Computational Complexity of Fundamental Problems in Social C...
Sort
View
ATAL
2003
Springer
14 years 1 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
ATAL
2009
Springer
14 years 3 months ago
Pragmatic-strategic reputation-based decisions in BDI agents
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
Isaac Pinyol, Jordi Sabater-Mir
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 2 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...