1662 search results - page 191 / 333 » The Computational Complexity of Agent Design Problems |
189
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
155
click to vote
TALG
2010
15 years 4 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
184
click to vote
ATAL
2007
Springer
16 years 19 days ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
212
click to vote
AAAI
2007
15 years 8 months ago
2007
In this paper, we consider a hybrid solution to the sensor network position inference problem, which combines a real-time filtering system with information from a more expensive,...
187
click to vote
AMEC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....