7930 search results - page 87 / 1586 » Greedy in Approximation Algorithms |
166
click to vote
APNOMS
2007
Springer
16 years 11 days ago
2007
Springer
We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in s...
195
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
156
click to vote
INFOCOM
2007
IEEE
16 years 14 days ago
2007
IEEE
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...
167
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
145
click to vote
INFOCOM
2008
IEEE
16 years 18 days ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...