Sciweavers

1095 search results - page 111 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
DAC
1995
ACM
15 years 1 months ago
Conflict Modelling and Instruction Scheduling in Code Generation for In-House DSP Cores
Application domain specific DSP cores are becoming increasingly popular due to their advantageous trade–off between flexibility and cost. However, existing code generation metho...
Adwin H. Timmer, Marino T. J. Strik, Jef L. van Me...
EDBT
2004
ACM
142views Database» more  EDBT 2004»
15 years 10 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
IFIPTCS
2010
14 years 8 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
ICRA
2009
IEEE
131views Robotics» more  ICRA 2009»
14 years 7 months ago
Efficient C-space and cost function updates in 3D for unmanned aerial vehicles
When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on devel...
Sebastian Scherer, Dave Ferguson, Sanjiv Singh
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 2 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...