Sciweavers

10051 search results - page 107 / 2011
» A Dynamic Separator Algorithm
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 6 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
MICRO
2010
IEEE
210views Hardware» more  MICRO 2010»
15 years 5 days ago
Thread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior
In a modern chip-multiprocessor system, memory is a shared resource among multiple concurrently executing threads. The memory scheduling algorithm should resolve memory contention...
Yoongu Kim, Michael Papamichael, Onur Mutlu, Mor H...
MICRO
2011
IEEE
407views Hardware» more  MICRO 2011»
14 years 9 months ago
Thread Cluster Memory Scheduling
In a modern chip-multiprocessor system, memory is a shared resource among multiple concurrently executing threads. The memory scheduling algorithm should resolve memory contention...
Yoongu Kim, Michael Papamichael, Onur Mutlu, Mor H...
147
Voted
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 7 months ago
Memory-based immigrants for genetic algorithms in dynamic environments
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
Shengxiang Yang
CCE
2004
15 years 2 months ago
Time (energy) requirements in closed batch distillation arrangements
Batch time (energy) requirements are provided for the separation of a zeotropic mixture in three batch column configurations. The separation tasks were performed in two different ...
S. Skouras, Sigurd Skogestad