1720 search results - page 67 / 344 » Unranking Combinations in Parallel |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
COMPCON
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper describes Tempest, a collection of mechanisms for communication and synchronization in parallel programs. With these mechanisms, authors of compilers, libraries, and ap...
SAC
2010
ACM
14 years 11 months ago
2010
ACM
The control flow of common processors does not match the specific needs of reactive systems. Key issues for these systems are preemption and concurrency, combined with timing pred...
DMIN
2006
14 years 11 months ago
2006
Clustering is the process of locating patterns in large data sets. It is an active research area that provides value to scientific as well as business applications. Practical clust...
ALGORITHMICA
2006
14 years 10 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...