6456 search results - page 367 / 1292 » Constraint Solving on Terms |
190
click to vote
IJCAI
2003
15 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
182
click to vote
IJCAI
2003
15 years 8 months ago
2003
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
163
Voted
AAAI
1990
15 years 8 months ago
1990
Recently-developed techniques have improved the performance of production systems several times over. However, these techniques are not yet adequate for continuous problem solving...
173
click to vote
APJOR
2010
15 years 7 months ago
2010
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
181
click to vote
CACM
2010
15 years 6 months ago
2010
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...