8949 search results - page 1419 / 1790 » is 1998 |
179
click to vote
CP
1998
Springer
15 years 12 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
213
click to vote
CP
1998
Springer
15 years 12 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
184
click to vote
CP
1998
Springer
15 years 12 months ago
1998
Springer
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
238
click to vote
CP
1998
Springer
15 years 12 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...
244
click to vote
CPE
1998
Springer
15 years 12 months ago
1998
Springer
This paper describes a modular and scalable simulation environment, called GloMoSim, to evaluate end-to-end performance of integrated wired and wireless networks. GloMoSim has been...