Sciweavers

1840 search results - page 132 / 368
» time 2002
Sort
View
TVLSI
2002
82views more  TVLSI 2002»
15 years 4 months ago
Probability-based approach to rectilinear Steiner tree problems
Abstract--The rectilinear Steiner tree (RST) problem is of essential importance to the automatic interconnect optimization for VLSI design. In this paper, we present a class of pro...
Chunhong Chen, Jiang Zhao, Majid Ahmadi
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 4 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
IPPS
2002
IEEE
15 years 9 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
IJCAI
2003
15 years 5 months ago
Dynamic Vehicle Routing with Stochastic Requests
This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables that are realized dynamically during plan execution. It propose...
Russell Bent, Pascal Van Hentenryck
RP
2010
Springer
118views Control Systems» more  RP 2010»
15 years 2 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa