4565 search results - page 375 / 913 » Time Optimal Self-Stabilizing Algorithms |
154
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
141
click to vote
VISUALIZATION
1997
IEEE
15 years 9 months ago
1997
IEEE
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...
179
click to vote
EJWCN
2010
14 years 11 months ago
2010
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...
139
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
111
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...