663 search results - page 110 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
DAC
2009
ACM
14 years 8 months ago
2009
ACM
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
ICDE
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...