Sciweavers

3049 search results - page 343 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICAI
2004
15 years 8 months ago
Task Oriented Machine-Learning and Review
We propose an optimization algorithm to execute a previously unlearned task-oriented command in an intelligent machine. We show that a well-defined, physically bounded, task-orien...
Pierre Abdelmalek, Howard E. Michel
SIGMETRICS
2011
ACM
140views Hardware» more  SIGMETRICS 2011»
14 years 9 months ago
On the stability and optimality of universal swarms
Recent work on BitTorrent swarms has demonstrated that a bandwidth bottleneck at the seed can lead to the underutilization of the aggregate swarm capacity. Bandwidth underutilizat...
Xia Zhou, Stratis Ioannidis, Laurent Massouli&eacu...
ICCAD
2001
IEEE
167views Hardware» more  ICCAD 2001»
16 years 3 months ago
Energy Efficient Real-Time Scheduling
- Real-time scheduling on processors that support dynamic voltage and frequency scaling is analyzed. The Slacked Earliest Deadling First (SEDF) algorithm is proposed and it is show...
Amit Sinha, Anantha Chandrakasan
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 10 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
JSS
2008
65views more  JSS 2008»
15 years 6 months ago
Process pipeline scheduling
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...
Melissa Lemos, Marco A. Casanova, Antonio L. Furta...