2089 search results - page 108 / 418 » A New Problem in String Searching |
MP
2002
14 years 9 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
IJCAI
2007
14 years 11 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
FLAIRS
2007
15 years 6 days ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
EOR
2008
14 years 10 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
AAAI
2004
14 years 11 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...