Sciweavers

59 search results - page 4 / 12
» Game-Based Notions of Locality Over Finite Models
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 4 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
IEEESCC
2005
IEEE
15 years 3 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
IJCV
2008
139views more  IJCV 2008»
14 years 9 months ago
Multilevel Image Coding with Hyperfeatures
Histograms of local appearance descriptors are a popular representation for visual recognition. They are highly discriminant with good resistance to local occlusions and to geomet...
Ankur Agarwal, Bill Triggs
WSC
2000
14 years 11 months ago
A new class of linear feedback shift register generators
An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congrue...
Pierre L'Ecuyer, François Panneton