Sciweavers

79 search results - page 15 / 16
» Universal Timed Concurrent Constraint Programming
Sort
View
ICCAD
2004
IEEE
87views Hardware» more  ICCAD 2004»
14 years 2 months ago
Exploiting level sensitive latches in wire pipelining
Wire pipelining emerges as a new necessity for global wires due to increasing wire delay, shrinking clock period and growing chip size. Existing approaches on wire pipelining are ...
V. Seth, Min Zhao, Jiang Hu
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
13 years 11 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
SPAA
2009
ACM
14 years 3 days ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
WORDS
2003
IEEE
13 years 10 months ago
Foucault's Pendulum in the Distributed Control Lab
The ’Distributed Control Lab’ [6] at Hasso-PlattnerInstitute, University of Potsdam allows experimentation with a variety of physical equipment via the web (intra and internet...
Andreas Rasche, Peter Tröger, Michael Dirska,...
TWC
2008
113views more  TWC 2008»
13 years 5 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai