175 search results - page 22 / 35 » Solution Strategies for Multi-domain Constraint Logic Progra... |
COCOS
2003
Springer
14 years 21 days ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
ARGMAS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
ICCS
2001
Springer
13 years 12 months ago
2001
Springer
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
HM
2009
Springer
14 years 3 days ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
KDD
2009
ACM
14 years 1 days ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...