Sciweavers

147 search results - page 27 / 30
» An optimal lower bound for anonymous scheduling mechanisms
Sort
View
SCOPES
2004
Springer
15 years 2 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
TMC
2012
12 years 12 months ago
E-MiLi: Energy-Minimizing Idle Listening in Wireless Networks
WiFi interface is known to be a primary energy consumer in mobile devices, and idle listening (IL) is the dominant source of energy consumption in WiFi. Most existing protocols, s...
Xinyu Zhang, Kang G. Shin
TECS
2010
74views more  TECS 2010»
14 years 8 months ago
Recovering from distributable thread failures in distributed real-time Java
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...
IPPS
2009
IEEE
15 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
93
Voted
ANOR
2011
117views more  ANOR 2011»
14 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover