693 search results - page 11 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
VLSID
2003
IEEE
16 years 2 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
134
Voted
ANOR
2002
15 years 1 months ago
2002
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
113
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
139
click to vote
AAAI
1996
15 years 3 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
123
click to vote
RTSS
2008
IEEE
15 years 8 months ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...