Sciweavers

1095 search results - page 154 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
14 years 11 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
ICMCS
2010
IEEE
139views Multimedia» more  ICMCS 2010»
14 years 11 months ago
LyDAR: A LYrics Density based Approach to non-homogeneous music Resizing
In many scenarios, such as TV/radio advertising production, animation production, and presentation, music pieces are constrained in the metric of time. For example, an editor want...
Zhang Liu, Chaokun Wang, Lu Guo, Yiyuan Bai, Jianm...
3DIM
2003
IEEE
15 years 1 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
CONCURRENCY
2004
99views more  CONCURRENCY 2004»
14 years 9 months ago
A performance study of job management systems
Job Management Systems (JMSs) efficiently schedule and monitor jobs in parallel and distributed computing environments. Therefore, they are critical for improving the utilization ...
Tarek A. El-Ghazawi, Kris Gaj, Nikitas A. Alexandr...
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen