192 search results - page 13 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
TMI
2008
14 years 9 months ago
2008
Abstract--Voxel-based reconstructions in diffuse optical tomography (DOT) using a quadratic regularization functional tend to produce very smooth images due to the attenuation of h...
VLSID
2006
IEEE
15 years 3 months ago
2006
IEEE
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
APWEB
2004
Springer
15 years 3 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
ECRTS
2010
IEEE
14 years 9 months ago
2010
IEEE
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
107
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...