Sciweavers

1220 search results - page 185 / 244
» Minimal Interval Completions
Sort
View
VLDB
1999
ACM
89views Database» more  VLDB 1999»
13 years 12 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
VLDB
1999
ACM
133views Database» more  VLDB 1999»
13 years 12 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
ISCA
1997
IEEE
104views Hardware» more  ISCA 1997»
13 years 12 months ago
Complexity-Effective Superscalar Processors
The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, ...
Subbarao Palacharla, Norman P. Jouppi, James E. Sm...
AGENTS
1997
Springer
13 years 12 months ago
Challenger: A Multi-agent System for Distributed Resource Allocation
In this paper we introduce Challenger, a multiagent system that performs completely distributed resource allocation. Challenger consists of agents which individually manage local ...
Anthony Chavez, Alexandros Moukas, Pattie Maes
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
13 years 12 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh