2747 search results - page 1 / 550 » Non-oblivious Strategy Improvement |
SAT
2010
Springer
13 years 3 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
AIED
2009
Springer
13 years 12 months ago
2009
Springer
Students use both domain-dependent strategies (such as seeking specific domain help) and domain-independent strategies (such as relaxation exercises) to help regulate their affecti...
LICS
2009
IEEE
13 years 12 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...