15033 search results - page 66 / 3007 » Complexity Theory and Algorithms |
137
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
124
Voted
COCO
2010
Springer
15 years 7 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
142
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
114
Voted
ICCD
2005
IEEE
16 years 13 days ago
2005
IEEE
In this paper we present algorithmic and architectural methodology for building Particle Filters in hardware. Particle filtering is a new paradigm for filtering in presence of n...
105
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...