88 search results - page 11 / 18 » Solving Non-Boolean Satisfiability Problems with Stochastic ... |
121
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
144
click to vote
LION
2007
Springer
15 years 9 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
127
click to vote
SLS
2009
Springer
15 years 10 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
117
Voted
RTSS
1999
IEEE
15 years 7 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
246
click to vote
NLP
2000
15 years 6 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...