Sciweavers

4491 search results - page 410 / 899
» Algorithm Engineering
Sort
View
FSTTCS
2009
Springer
15 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 9 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
ICSE
2005
IEEE-ACM
16 years 4 months ago
Efficient and precise dynamic impact analysis using execute-after sequences
As software evolves, impact analysis estimates the potential effects of changes, before or after they are made, by identifying which parts of the software may be affected by such ...
Taweesup Apiwattanapong, Alessandro Orso, Mary Jea...
EMSOFT
2004
Springer
15 years 10 months ago
Using resource reservation techniques for power-aware scheduling
Minimizing energy consumption is an important issue in the design of real-time embedded systems. As many embedded systems are powered by rechargeable batteries, the goal is to ext...
Claudio Scordino, Giuseppe Lipari
FCCM
1998
IEEE
169views VLSI» more  FCCM 1998»
15 years 8 months ago
Scalable Network Based FPGA Accelerators for an Automatic Target Recognition Application
Abstract Image processing, specifically Automatic Target Recognition (ATR) in Synthetic Aperture Radar (SAR) imagery, is an application area that can require tremendous processing ...
Ruth Sivilotti, Young Cho, Wen-King Su, Danny Cohe...