Sciweavers

184 search results - page 32 / 37
» Near Neighbor Search in Large Metric Spaces
Sort
View
LCTRTS
2004
Springer
14 years 4 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 11 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
IPPS
1999
IEEE
14 years 3 months ago
A Performance Model of Speculative Prefetching in Distributed Information Systems
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh
AIPS
2006
14 years 8 days ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
DAC
1999
ACM
14 years 3 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther