6105 search results - page 363 / 1221 » A Parallel Algorithm for Bound-Smoothing |
201
click to vote
DPD
2006
15 years 6 months ago
2006
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
175
click to vote
IJAIT
2007
15 years 6 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
175
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
176
click to vote
HPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we introduce the Join-Elect-Leave (JEL) model, a simple yet powerful model for tracking the resources participating in an application. This model is based on the co...
163
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Designing effective behavioral controllers for mobile robots can be difficult and tedious; this process can be circumvented by using unsupervised learning techniques w...