Sciweavers

12950 search results - page 74 / 2590
» On Optimal Timed Strategies
Sort
View
ICS
2000
Tsinghua U.
14 years 15 days ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
DAGSTUHL
2000
13 years 10 months ago
On the Competitive Complexity of Navigation Tasks
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 7 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 6 months ago
On the Optimality of Spiral Search
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
Elmar Langetepe
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 3 months ago
TSDS: high-performance merge, subset, and filter software for time series-like data
Time Series Data Server (TSDS) is a software package for implementing a server that provides fast supersetting, sub-setting, filtering, and uniform gridding of time series-like dat...
Robert S. Weigel, Doug M. Lindholm, A. Wilson, Jer...