Sciweavers

1174 search results - page 95 / 235
» Optimizing generics is easy!
Sort
View
DOLAP
2007
ACM
14 years 2 months ago
Optimal chunking of large multidimensional arrays for data warehousing
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri
AI
2006
Springer
13 years 10 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 4 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
DAC
2005
ACM
14 years 11 months ago
Energy optimal speed control of devices with discrete speed sets
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...
Ravishankar Rao, Sarma B. K. Vrudhula
PLDI
1997
ACM
14 years 2 months ago
Flick: A Flexible, Optimizing IDL Compiler
An interface definition language (IDL) is a nontraditional language for describing interfaces between software components. IDL compilers generate “stubs” that provide separat...
Eric Eide, Kevin Frei, Bryan Ford, Jay Lepreau, Ga...