Sciweavers

407 search results - page 22 / 82
» The Optimal Online Algorithms for Minimizing Maximum Latenes...
Sort
View
WABI
2004
Springer
109views Bioinformatics» more  WABI 2004»
15 years 2 months ago
Online Consensus and Agreement of Phylogenetic Trees
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...
Tanya Y. Berger-Wolf
GLOBECOM
2007
IEEE
15 years 3 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
75
Voted
RANDOM
1999
Springer
15 years 1 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
IEAAIE
1994
Springer
15 years 1 months ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
MONET
2006
141views more  MONET 2006»
14 years 9 months ago
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
Ritesh Madan, Sanjay Lall