Sciweavers

1184 search results - page 208 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
154
Voted
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
109
Voted
GPCE
2009
Springer
15 years 22 days ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen
CIKM
2009
Springer
15 years 2 months ago
Low-cost management of inverted files for online full-text search
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
Giorgos Margaritis, Stergios V. Anastasiadis
ICPPW
2007
IEEE
15 years 3 months ago
Power Management of Multicore Multiple Voltage Embedded Systems by Task Scheduling
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
Gang Qu