Sciweavers

210 search results - page 17 / 42
» Excludability and Bounded Computational Capacity
Sort
View
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
14 years 6 months ago
Energy budgeting for battery-powered sensors with a known task schedule
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
Daler N. Rakhmatov
DAGSTUHL
2008
13 years 11 months ago
Complete Interval Arithmetic and its Implementation
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
Ulrich W. Kulisch
ICALP
2009
Springer
14 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
RTSS
2005
IEEE
14 years 3 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
COCOON
2007
Springer
14 years 4 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...