2398 search results - page 119 / 480 » Constraint Programming and Graph Algorithms |
136
click to vote
AAAI
1998
15 years 6 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
121
Voted
ACTAC
2007
15 years 5 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
137
Voted
WEA
2005
Springer
15 years 10 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
162
click to vote
SECON
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
136
Voted
IRAL
2000
ACM
15 years 9 months ago
2000
ACM
We propose a method to create process flow graphs automatically from textbooks for cooking programs. This is realized by understanding context by narrowing down the domain to cook...