Sciweavers

12950 search results - page 399 / 2590
» On Optimal Timed Strategies
Sort
View
ATMOS
2008
15 years 8 months ago
Engineering Time-Expanded Graphs for Faster Timetable Information
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...
Daniel Delling, Thomas Pajor, Dorothea Wagner
MA
2010
Springer
85views Communications» more  MA 2010»
15 years 5 months ago
K-sample subsampling in general spaces: The case of independent time series
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case ...
Dimitris N. Politis, Joseph P. Romano
VLDB
1995
ACM
96views Database» more  VLDB 1995»
15 years 10 months ago
The Fittest Survives: An Adaptive Approach to Query Optimization
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Hongjun Lu, Kian-Lee Tan, Son Dao
197
Voted
MST
2007
167views more  MST 2007»
15 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
SIAMSC
2008
75views more  SIAMSC 2008»
15 years 6 months ago
Well-Balanced Time Implicit Formulation of Relaxation Schemes for the Euler Equations
We show how to derive time implicit formulations of relaxation schemes for the Euler equations for real materials in several space dimensions. In the fully time explicit setting, t...
Christophe Chalons, Frédéric Coquel,...