1101 search results - page 77 / 221 » An Algorithm for the Graph Crossing Number Problem |
146
Voted
SPDP
1991
IEEE
15 years 6 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
133
Voted
PPAM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
119
Voted
FUIN
2006
15 years 2 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
114
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
132
Voted
IJNSEC
2007
15 years 2 months ago
2007
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...