Sciweavers

229 search results - page 21 / 46
» Proving Bounds on Real-Valued Functions with Computations
Sort
View
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 2 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
AI
2010
Springer
14 years 10 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
JAIR
2008
126views more  JAIR 2008»
14 years 10 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
4OR
2004
63views more  4OR 2004»
14 years 10 months ago
A note on robust 0-1 optimization with uncertain cost coefficients
Abstract. Based on the recent approach of Bertsimas and Sim (2004, 2003) to robust optimization in the presence of data uncertainty, we prove an easily computable and simple bound ...
Mustafa Ç. Pinar
LICS
2006
IEEE
15 years 4 months ago
Fixed-Parameter Hierarchies inside PSPACE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
Guoqiang Pan, Moshe Y. Vardi