Sciweavers

1717 search results - page 116 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 11 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
BMCBI
2006
161views more  BMCBI 2006»
15 years 6 months ago
A method for rapid similarity analysis of RNA secondary structures
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...
Na Liu, Tianming Wang
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 6 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
ISORC
2008
IEEE
16 years 24 days ago
Toward Effective Multi-Capacity Resource Allocation in Distributed Real-Time and Embedded Systems
Effective resource management for distributed real-time embedded (DRE) systems is hard due to their unique characteristics, including (1) constraints in multiple resources and (2)...
Nilabja Roy, John S. Kinnebrew, Nishanth Shankaran...
WSC
2001
15 years 7 months ago
Fluid model for window-based congestion control mechanism
We study the stability of two queueing delay-based congestion control algorithms, the (p, 1)-proportionally fair algorithm and the global optimization algorithm. We linearize the ...
Richard J. La