Sciweavers

807 search results - page 10 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
FGCS
2000
81views more  FGCS 2000»
14 years 11 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
DAM
2008
135views more  DAM 2008»
14 years 11 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
15 years 3 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers
JSAC
2008
56views more  JSAC 2008»
14 years 11 months ago
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product spac
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato
CAV
2008
Springer
99views Hardware» more  CAV 2008»
15 years 1 months ago
Correcting a Space-Efficient Simulation Algorithm
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
Rob J. van Glabbeek, Bas Ploeger