Sciweavers

1347 search results - page 29 / 270
» On the Structure of the Minimum Time Function
Sort
View
121
Voted
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 10 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, ...
114
Voted
CSCWD
2005
Springer
15 years 5 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
139
Voted
EMSOFT
2004
Springer
15 years 9 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
115
Voted
ESA
2007
Springer
99views Algorithms» more  ESA 2007»
15 years 9 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
121
Voted
IS
2010
15 years 2 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