Sciweavers

505 search results - page 53 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
NETCOOP
2007
Springer
15 years 6 months ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski
MOBIDE
2003
ACM
15 years 5 months ago
TiNA: a scheme for temporal coherency-aware in-network aggregation
This paper presents TiNA, a scheme for minimizing energy consumption in sensor networks by exploiting end-user tolerance to temporal coherency. TiNA utilizes temporal coherency to...
Mohamed A. Sharaf, Jonathan Beaver, Alexandros Lab...
ICCD
2007
IEEE
215views Hardware» more  ICCD 2007»
15 years 8 months ago
A 4.6Tbits/s 3.6GHz single-cycle NoC router with a novel switch allocator in 65nm CMOS
As chip multiprocessors (CMPs) become the only viable way to scale up and utilize the abundant transistors made available in current microprocessors, the design of on-chip network...
Amit Kumar 0002, Partha Kundu, Arvind P. Singh, Li...
EMSOFT
2008
Springer
15 years 1 months ago
Wireless channel access reservation for embedded real-time systems
Reservation-based channel access has been shown to be effective in providing Quality of Service (QoS) guarantees (e.g., timeliness) in wireless embedded real-time applications suc...
Dinesh Rajan, Christian Poellabauer, Xiaobo Sharon...
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 5 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...