Sciweavers

10608 search results - page 401 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
MASCOTS
2001
15 years 5 months ago
Minimizing Routing State for Light-Weight Network Simulation
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
Polly Huang, John S. Heidemann
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 5 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
MOBIHOC
2007
ACM
16 years 4 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ALT
2004
Springer
16 years 1 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 10 months ago
A comparison of evolutionary algorithms for system-level diagnosis
The size and complexity of systems based on multiple processing units demand techniques for the automatic diagnosis of their state. System-level diagnosis consists in determining ...
Bogdan Tomoyuki Nassu, Elias Procópio Duart...