1026 search results - page 85 / 206 » On Finding Minimal w-cutset |
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elu...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
150
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
PERCOM
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proxi...