1662 search results - page 160 / 333 » The Computational Complexity of Agent Design Problems |
159
click to vote
ISCAPDCS
2003
15 years 5 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
103
click to vote
JDM
2000
15 years 3 months ago
2000
Advanced Traveler Information Systems (ATIS) require e cient information retrieval and updating in a dynamic environment at di erent geographical scales. ATIS applications are use...
145
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
A new strategy is proposed for the design of cascaded object detectors of high detection-rate. The problem of jointly minimizing the false-positive rate and classification complex...
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Last years have witnessed how crowd simulations have become an essential tool for many virtual environment applications. These applications require both rendering visually plausib...
121
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Many important problems in multiagent systems can be seen as resource allocation problems. For such problems, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, in...