Sciweavers

1031 search results - page 40 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
AUSAI
2007
Springer
13 years 11 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
ICEIS
2003
IEEE
14 years 1 months ago
Distributed Overload Control for Real-Time Replicated Database Systems
: In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replicatio...
Samia Saad-Bouzefrane, Claude Kaiser
VLDB
1998
ACM
138views Database» more  VLDB 1998»
13 years 12 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang
ICLP
2004
Springer
14 years 1 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
MOR
2006
90views more  MOR 2006»
13 years 7 months ago
Optimal Control of a High-Volume Assemble-to-Order System
This paper provides guidance for operating an assemble-to-order system to maximize expected discounted profit, assuming that a high volume of prospective customers arrive per unit...
Erica L. Plambeck, Amy R. Ward