942 search results - page 59 / 189 » Constraints in Graph Drawing Algorithms |
99
Voted
CSCLP
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
142
Voted
AIME
2009
Springer
15 years 9 months ago
2009
Springer
Note taking is a common way for physicians to collect information from their patients in medical inquiries and diagnoses. Many times, when describing the pathology in medical recor...
111
click to vote
ASAP
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
111
Voted
AIPS
2000
15 years 4 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
113
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...