Sciweavers

5331 search results - page 460 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ATAL
2010
Springer
15 years 1 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
SIGMETRICS
2011
ACM
198views Hardware» more  SIGMETRICS 2011»
15 years 1 months ago
Memory Trace Compression and Replay for SPMD Systems using Extended PRSDs?
Concurrency levels in large-scale supercomputers are rising exponentially, and shared-memory nodes with hundreds of cores and non-uniform memory access latencies are expected with...
Sandeep Budanur, Frank Mueller, Todd Gamblin
GLOBECOM
2007
IEEE
16 years 1 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
CVPR
2009
IEEE
16 years 1 months ago
Optimal scanning for faster object detection
Recent years have seen the development of fast and accurate algorithms for detecting objects in images. However, as the size of the scene grows, so do the running-times of these a...
Nicholas J. Butko, Javier R. Movellan
BMCBI
2005
134views more  BMCBI 2005»
15 years 6 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001