19866 search results - page 3808 / 3974 » Computing all factorizations in *** |
163
click to vote
WAOA
2005
Springer
16 years 20 hour ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
162
click to vote
WINE
2005
Springer
16 years 19 hour ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
176
click to vote
ASPLOS
2004
ACM
15 years 12 months ago
2004
ACM
We present a novel processor architecture designed specifically for use in low-power wireless sensor-network nodes. Our sensor network asynchronous processor (SNAP/LE) is based on...
152
click to vote
ASPLOS
2004
ACM
15 years 12 months ago
2004
ACM
This paper explores a new technique called coherence decoupling, which breaks a traditional cache coherence protocol into two protocols: a Speculative Cache Lookup (SCL) protocol ...
175
click to vote
CASES
2004
ACM
15 years 12 months ago
2004
ACM
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...