1197 search results - page 36 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
271
click to vote
AGP
2010
IEEE
15 years 10 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
135
click to vote
TRANSCI
2011
15 years 15 days ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
144
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
149
click to vote
ACSC
2005
IEEE
15 years 11 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
183
Voted
AMAI
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...