Sciweavers

1347 search results - page 29 / 270
» On the Structure of the Minimum Time Function
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
CSCWD
2005
Springer
13 years 9 months ago
The structure representation for the concurrent analysis of product assembly and disassembly
This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix de...
Jyh-Cheng Yu, Yi-Ming Li
EMSOFT
2004
Springer
14 years 1 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
ESA
2007
Springer
99views Algorithms» more  ESA 2007»
14 years 1 months ago
Linear-Time Ranking of Permutations
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
Martin Mares, Milan Straka
IS
2010
13 years 6 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley