Sciweavers

2950 search results - page 3 / 590
» Computing with Infinitely Many Processes
Sort
View
UAI
2004
13 years 9 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
ICMAS
2000
13 years 8 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
CVPR
2012
IEEE
11 years 10 months ago
Tracking many vehicles in wide area aerial surveillance
Wide area aerial surveillance data has recently proliferated and increased the demand for multi-object tracking algorithms. However, the limited appearance information on every ta...
Jan Prokaj, Xuemei Zhao, Gérard G. Medioni
FOSSACS
2004
Springer
13 years 11 months ago
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
Pablo Giambiagi, Gerardo Schneider, Frank D. Valen...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah