3020 search results - page 423 / 604 » Optimal partition trees |
182
click to vote
QOSIP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
151
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
148
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...
212
click to vote
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
154
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Most traffic management and optimization tasks, such as accident detection or optimal vehicle routing, require an ability to adequately model, reason about and predict irregular an...