Sciweavers

256 search results - page 48 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
IWCMC
2010
ACM
14 years 17 days ago
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...
Wei Yang, Weifa Liang, Jun Luo, Wenhua Dou
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 8 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...