229 search results - page 21 / 46 » Proving Bounds on Real-Valued Functions with Computations |
125
Voted
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
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 ...
AI
2010
Springer
15 years 18 days ago
2010
Springer
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 ...
120
Voted
JAIR
2008
15 years 13 days ago
2008
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 ...
97
Voted
4OR
2004
15 years 10 days ago
2004
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 ...
115
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...