Sciweavers

1920 search results - page 295 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 10 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 10 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
ICTAI
2003
IEEE
15 years 10 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
166
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
Integrating effective-bandwidth-based QoS routing and best effort routing
—A methodology is presented for integrating effective-bandwidth-based routing for QoS-sensitive traffic and datagram routing of the best-effort traffic. To prevent excessive dela...
Stephen L. Spitler, Daniel C. Lee
RSP
2003
IEEE
149views Control Systems» more  RSP 2003»
15 years 10 months ago
Rapid Scheduling of Efficient VLSI Architectures for Next-Generation HSDPA
In this paper, an efficient design flow integrating Mentor Graphics Precesion C and HDL designer is derived. In this hybrid prototyping environment, efficient FPGA architectures a...
Yuanbin Guo, Gang Xu, Dennis McCain, Joseph R. Cav...