2432 search results - page 91 / 487 » Degrees and choice numbers |
204
click to vote
CP
1998
Springer
15 years 10 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
137
click to vote
ISSAC
2007
Springer
16 years 13 days ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
110
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is b...
158
click to vote
GIAE
2004
Springer
15 years 11 months ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...
142
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...