1101 search results - page 84 / 221 » An Algorithm for the Graph Crossing Number Problem |
168
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
126
click to vote
ADBIS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
143
Voted
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
150
click to vote
ICPP
1999
IEEE
15 years 9 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
152
click to vote
JDA
2006
15 years 4 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...