Sciweavers

4315 search results - page 235 / 863
» Sorting in linear time
Sort
View
AAAI
2007
13 years 12 months ago
Propagating Knapsack Constraints in Sublinear Time
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal ...
SIROCCO
2003
13 years 11 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
JNS
2007
85views more  JNS 2007»
13 years 9 months ago
Long-Time Accuracy for Approximate Slow Manifolds in a Finite-Dimensional Model of Balance
We study the slow singular limit for planar anharmonic oscillatory motion of a charged particle under the influence of a perpendicular magnetic field when the mass of the particl...
G. Gottwald, M. Oliver, N. Tecu
IJSYSC
2010
97views more  IJSYSC 2010»
13 years 8 months ago
A stability study on first-order neutral systems with three rationally independent time delays
— First order linear time invariant and time delayed dynamics of neutral type is taken into account with three rationally independent delays. There are two main contributions of ...
Rifat Sipahi, Nejat Olgaç, Dimitri Breda
FSTTCS
2010
Springer
13 years 7 months ago
Two Size Measures for Timed Languages
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
Eugene Asarin, Aldric Degorre