Sciweavers

196 search results - page 29 / 40
» Supporting OO Design Heuristics
Sort
View
IPCO
2004
110views Optimization» more  IPCO 2004»
13 years 11 months ago
Scheduling an Industrial Production Facility
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A....
VLDB
2004
ACM
128views Database» more  VLDB 2004»
14 years 10 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
14 years 10 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
SEMWEB
2009
Springer
14 years 4 months ago
Optimizing Web Service Composition While Enforcing Regulations
Abstract. To direct automated Web service composition, it is compelling to provide a template, workflow or scaffolding that dictates the ways in which services can be composed. I...
Shirin Sohrabi, Sheila A. McIlraith
FCCM
2007
IEEE
115views VLSI» more  FCCM 2007»
14 years 4 months ago
Generating FPGA-Accelerated DFT Libraries
We present a domain-specific approach to generate highperformance hardware-software partitioned implementations of the discrete Fourier transform (DFT) in fixed point precision....
Paolo D'Alberto, Peter A. Milder, Aliaksei Sandryh...