Sciweavers

400 search results - page 20 / 80
» Backtracking
Sort
View
ECAI
1994
Springer
14 years 1 months ago
Operationalizing Conceptual Models Based on a Model of Dependencies
Abstract. In this paper we describe a framework for defining and operationalizing conceptual models of distributed knowledge-based systems which extends published approaches by the...
Frank Maurer, Jürgen Paulokat
CP
2006
Springer
14 years 1 months ago
Randomization in Constraint Programming for Airline Planning
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Lars Otten, Mattias Grönkvist, Devdatt P. Dub...
LISP
2002
81views more  LISP 2002»
13 years 9 months ago
Linear Continuation-Passing
Abstract. Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (goto...
Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hay...
CP
2005
Springer
14 years 3 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
ICNP
2002
IEEE
14 years 2 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...