16404 search results - page 184 / 3281 » A set coverage problem |
110
Voted
ENDM
2000
15 years 3 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
182
click to vote
DAM
2011
14 years 10 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
142
Voted
ISCA
1993
IEEE
15 years 7 months ago
1993
IEEE
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
139
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
112
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...