Sciweavers

1502 search results - page 164 / 301
» Node weighted scheduling
Sort
View
CSE
2009
IEEE
15 years 6 months ago
Completely Distributed Low Duty Cycle Communication for Long-Living Sensor Networks
A lifetime of several years for wireless sensor nodes can be achieved if their activity period is minimized. This can be done by using low duty cycle protocols. One of the challeng...
Marcin Brzozowski, Hendrik Salomon, Peter Langendo...
124
Voted
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
15 years 5 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
PPSC
2001
15 years 4 months ago
Airline Crew Pairing Generation in Parallel
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
Diego Klabjan, Karsten Schwan
137
Voted
AMKM
2003
Springer
15 years 8 months ago
A Spreading Activation Framework for Ontology-Enhanced Adaptive Information Access within Organisations
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
Md Maruf Hasan
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 4 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta