Sciweavers

7930 search results - page 36 / 1586
» Greedy in Approximation Algorithms
Sort
View
CODES
2010
IEEE
15 years 14 days ago
A greedy buffer allocation algorithm for power-aware communication in body sensor networks
Monitoring human movements using wireless sensory devices promises to revolutionize the delivery of healthcare services. In spite of their potentials for many application domains,...
Hassan Ghasemzadeh, Roozbeh Jafari
109
Voted
JSS
2010
104views more  JSS 2010»
14 years 9 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman
ICDT
2010
ACM
137views Database» more  ICDT 2010»
15 years 1 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
INFOCOM
2008
IEEE
15 years 8 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
SPAA
1994
ACM
15 years 6 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher