Sciweavers

1277 search results - page 158 / 256
» Terminating Decision Algorithms Optimally
Sort
View
140
Voted
AAAI
2004
15 years 5 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
138
Voted
FUIN
2002
132views more  FUIN 2002»
15 years 3 months ago
RIONA: A New Classification System Combining Rule Induction and Instance-Based Learning
The article describes a method combining two widely-used empirical approaches to learning from examples: rule induction and instance-based learning. In our algorithm (RIONA) decisi...
Grzegorz Góra, Arkadiusz Wojna
129
Voted
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 3 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
115
Voted
ICDCS
2010
IEEE
15 years 7 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
106
Voted
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 9 months ago
Benefits of software measures for evolutionary white-box testing
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
Frank Lammermann, Stefan Wappler