4126 search results - page 589 / 826 » Set based logic programming |
111
click to vote
SLP
1989
15 years 4 months ago
1989
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
113
click to vote
EOR
2010
15 years 3 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
102
click to vote
EOR
2006
15 years 3 months ago
2006
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
126
click to vote
JCO
2007
15 years 3 months ago
2007
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
125
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...