Sciweavers

7930 search results - page 44 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 3 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
LCN
1999
IEEE
15 years 6 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
124
Voted
ICSE
2005
IEEE-ACM
16 years 2 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...
IWCMC
2009
ACM
15 years 7 months ago
Scheduling cooperative emergency response: or how the meek shall overcome the greedy
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
Carol Dottin, Bilal Khan
SIAMNUM
2010
114views more  SIAMNUM 2010»
14 years 9 months ago
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
Len Bos, Stefano De Marchi, Alvise Sommariva, Marc...