Sciweavers

3946 search results - page 685 / 790
» The computational complexity of choice sets
Sort
View
FGCS
2000
81views more  FGCS 2000»
15 years 6 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
ENTCS
2002
128views more  ENTCS 2002»
15 years 6 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
EOR
2002
74views more  EOR 2002»
15 years 6 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
JAIR
2000
105views more  JAIR 2000»
15 years 6 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
JHSN
2000
172views more  JHSN 2000»
15 years 6 months ago
Dynamic token bucket (DTB): a fair bandwidth allocation algorithm for high-speed networks
Fair allocation of available bandwidth to competing flows is a simple form of quality of service (QoS) that can be provided to customers in packet-switched networks. A number of p...
Jayakrishna Kidambi, Dipak Ghosal, Biswanath Mukhe...