Sciweavers

4839 search results - page 871 / 968
» A survey of computational complexity results in systems and ...
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 8 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
ICNP
2002
IEEE
15 years 6 months ago
Using Adaptive Rate Estimation to Provide Enhanced and Robust Transport over Heterogeneous Networks
The rapid advancement in wireless communication technology has spurred significant interest in the design and development of enhanced TCP protocols. Among them, TCP Westwood (TCPW...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Mario Ger...
ISSTA
2000
ACM
15 years 6 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
BMCBI
2008
121views more  BMCBI 2008»
15 years 1 months ago
Stability of gene contributions and identification of outliers in multivariate analysis of microarray data
Background: Multivariate ordination methods are powerful tools for the exploration of complex data structures present in microarray data. These methods have several advantages com...
Florent Baty, Daniel Jaeger, Frank Preiswerk, Mart...
JACM
2006
99views more  JACM 2006»
15 years 1 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller