Sciweavers

4698 search results - page 175 / 940
» Making Functionality More General
Sort
View
135
Voted
MST
2010
98views more  MST 2010»
15 years 2 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
105
Voted
SEFM
2006
IEEE
15 years 9 months ago
On Bisimilarities Induced by Relations on Actions
In this paper, we give a straightforward generalization of bisimulations to "bisimulations induced by a pair of relations" on the underlying action set. We establish tha...
S. Arun-Kumar
147
Voted
AAAI
2006
15 years 5 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
135
Voted
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
15 years 7 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
113
Voted
FSS
2007
113views more  FSS 2007»
15 years 3 months ago
The core of bicapacities and bipolar games
Bicooperative games generalize classical cooperative games in the sense that a player is allowed to play in favor or against some aim, besides non participation. Bicapacities are ...
Lijue Xie, Michel Grabisch