13841 search results - page 18 / 2769 » Algorithms and Constraint Programming |
CP
2003
Springer
15 years 2 months ago
2003
Springer
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
RIVF
2003
14 years 10 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
109
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 1 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
MA
1999
Springer
15 years 1 months ago
1999
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efï...