Sciweavers

1484 search results - page 271 / 297
» Ants meeting algorithms
Sort
View
CASES
2003
ACM
14 years 2 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna
INFOCOM
2000
IEEE
14 years 2 months ago
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks
Abstract--A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting stati...
Robert Boorstyn, Almut Burchard, Jörg Liebehe...
POPL
2010
ACM
14 years 1 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
DLS
2008
149views Languages» more  DLS 2008»
14 years 29 days ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
14 years 18 days ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...