Sciweavers

1310 search results - page 151 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 11 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
ICPP
2005
IEEE
15 years 10 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
WSC
2004
15 years 6 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling
HPDC
2007
IEEE
15 years 11 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely
IAJIT
2006
109views more  IAJIT 2006»
15 years 4 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...