Sciweavers

2244 search results - page 195 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ECCC
2007
99views more  ECCC 2007»
15 years 7 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
CGO
2007
IEEE
16 years 1 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
ICIP
2003
IEEE
16 years 8 months ago
Removal of video line jitter using a dynamic programming approach
Analog video digitized from noisy sources can suffer of line registration problems due to bad synchronization pulses. The effect is that the image lines are randomly shiftedwith r...
Louis Laborelli
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 8 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
JAIR
2007
141views more  JAIR 2007»
15 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf