Sciweavers

1184 search results - page 72 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
111
Voted
FSTTCS
2009
Springer
15 years 9 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
CASES
2007
ACM
15 years 6 months ago
Fragment cache management for dynamic binary translators in embedded systems with scratchpad
Dynamic binary translation (DBT) has been used to achieve numerous goals (e.g., better performance) for general-purpose computers. Recently, DBT has also attracted attention for e...
José Baiocchi, Bruce R. Childers, Jack W. D...
106
Voted
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 8 months ago
An artificial immune network for multimodal function optimization on dynamic environments
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the sea...
Fabrício Olivetti de França, Fernand...
WSC
1998
15 years 3 months ago
Parallel Implementation of a Molecular Dynamics Simulation Program
We have taken a NIST molecular dynamics simulation program (md3), which was configured as a single sequential process running on a CRAY C90 vector supercomputer, and parallelized ...
Alan Mink, Christophe Bailly
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
14 years 5 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...