Sciweavers

164 search results - page 4 / 33
» Selecting Robust Strategies Based on Abstracted Game Models
Sort
View
SAT
2009
Springer
111views Hardware» more  SAT 2009»
13 years 12 months ago
Restart Strategy Selection Using Machine Learning Techniques
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
Shai Haim, Toby Walsh
ISSTA
2004
ACM
13 years 10 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
ACL
2011
12 years 9 months ago
Learning to Win by Reading Manuals in a Monte-Carlo Framework
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
S. R. K. Branavan, David Silver, Regina Barzilay
TON
2008
136views more  TON 2008»
13 years 5 months ago
Density-based anycast: a robust routing strategy for wireless ad hoc networks
Abstract--Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing para...
Vincent Lenders, Martin May, Bernhard Plattner