Sciweavers

5831 search results - page 10 / 1167
» Distributed Dynamic Backtracking
Sort
View
APN
2003
Springer
14 years 1 months ago
Deciding Life-Cycle Inheritance on Petri Nets
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynam...
H. M. W. (Eric) Verbeek, Twan Basten
IEAAIE
2001
Springer
14 years 1 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
ICNP
2002
IEEE
14 years 1 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,...
ANOR
2004
116views more  ANOR 2004»
13 years 8 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
CP
2005
Springer
14 years 2 months ago
Search Heuristics and Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan