Sciweavers

5230 search results - page 189 / 1046
» Dynamic Optimality -- Almost
Sort
View
OOPSLA
2007
Springer
15 years 10 months ago
Using hpm-sampling to drive dynamic compilation
All high-performance production JVMs employ an adaptive strategy for program execution. Methods are first executed unoptimized and then an online profiling mechanism is used to ...
Dries Buytaert, Andy Georges, Michael Hind, Matthe...
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
15 years 9 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass
ICDCS
2003
IEEE
15 years 9 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
CDC
2009
IEEE
172views Control Systems» more  CDC 2009»
15 years 8 months ago
A dynamic boundary guarding problem with translating targets
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
Stephen L. Smith, Shaunak Dattaprasad Bopardikar, ...
IPPS
2000
IEEE
15 years 8 months ago
Dynamic Data Layouts for Cache-Conscious Factorization of DFT
Effective utilization of cache memories is a key factor in achieving high performance in computing the Discrete Fourier Transform (DFT). Most optimizationtechniques for computing ...
Neungsoo Park, Dongsoo Kang, Kiran Bondalapati, Vi...