1662 search results - page 123 / 333 » The Computational Complexity of Agent Design Problems |
121
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
135
click to vote
CIA
2004
Springer
15 years 9 months ago
2004
Springer
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
131
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
136
click to vote
AAAI
2006
15 years 5 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
115
click to vote
AIPS
2003
15 years 5 months ago
2003
We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its signific...