177 search results - page 11 / 36 » Analyzing Blockwise Lattice Algorithms Using Dynamical Syste... |
RTCSA
2007
IEEE
14 years 1 months ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
NIPS
2003
13 years 8 months ago
2003
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
HICSS
2008
IEEE
14 years 1 months ago
2008
IEEE
While executing a process, many decisions are taken at its various decision points for selecting paths. There is a need for understanding and analyzing on various paths that emana...
SPAA
1994
ACM
13 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
JSSPP
2004
Springer
14 years 2 days ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...