1144 search results - page 153 / 229 » Logic programming for combinatorial problems |
143
click to vote
IJCNN
2006
IEEE
16 years 9 days ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
177
click to vote
ICCL
1998
IEEE
15 years 10 months ago
1998
IEEE
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
178
click to vote
TCS
2010
15 years 4 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
144
click to vote
ICLP
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
333
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...