Sciweavers

178 search results - page 15 / 36
» Bounds, Heuristics, and Approximations for Distribution Syst...
Sort
View
QEST
2006
IEEE
14 years 2 months ago
Limiting Behavior of Markov Chains with Eager Attractors
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
TIT
2002
164views more  TIT 2002»
13 years 8 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
HPCA
2007
IEEE
14 years 9 months ago
Exploiting Postdominance for Speculative Parallelization
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam...
JPDC
2007
92views more  JPDC 2007»
13 years 8 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
IJCSA
2007
110views more  IJCSA 2007»
13 years 8 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari