2398 search results - page 154 / 480 » Constraint Programming and Graph Algorithms |
199
click to vote
FAW
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
183
click to vote
ICPP
1993
IEEE
15 years 10 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
172
click to vote
CPAIOR
2007
Springer
16 years 12 days ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
181
click to vote
CODES
2005
IEEE
15 years 12 months ago
2005
IEEE
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
169
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...