1101 search results - page 69 / 221 » An Algorithm for the Graph Crossing Number Problem |
133
Voted
AIPS
2010
15 years 4 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
115
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
112
Voted
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
119
Voted
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
123
click to vote
DAM
2010
15 years 2 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...