23 search results - page 3 / 5 » A new class of asynchronous iterative algorithms with order ... |
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
DAM
2006
13 years 8 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
JCP
2007
13 years 8 months ago
2007
Abstract—This paper establishes a new coherent framework to extend the class of unitary warping operators to the case of discrete–time sequences. Providing some a priori consid...
UAI
2003
13 years 10 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
SWAT
1994
Springer
14 years 19 days ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...