2314 search results - page 319 / 463 » Minimal Partitions of a Graph |
120
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
107
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
134
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
150
Voted
FLAIRS
2008
15 years 6 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
141
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...