1171 search results - page 175 / 235 » Variable neighborhood search |
JSAT
2008
13 years 9 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
JCP
2006
13 years 9 months ago
2006
Our study proposes mutual aid platforms for the resolution of uncommon or non-conforming cases in both administrative and commercial procedures. On reviewing inter-customer interac...
EOR
2007
13 years 9 months ago
2007
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
AICOM
2004
13 years 9 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
CP
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, ...