Sciweavers

707 search results - page 82 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 3 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
ENVSOFT
2007
88views more  ENVSOFT 2007»
13 years 9 months ago
Resampling-based software for estimating optimal sample size
The SISSI program implements a novel approach for the estimation of the optimal sample size in experimental data collection. It provides avisual evaluation system of sample size d...
Roberto Confalonieri, Marco Acutis, Gianni Bellocc...
OOPSLA
2007
Springer
14 years 3 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...
IEEEARES
2007
IEEE
14 years 3 months ago
Near Optimal Protection Strategies Against Targeted Attacks on the Core Node of a Network
The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their resp...
Frank Yeong-Sung Lin, Po-Hao Tsang, Yi-Luen Lin
CPAIOR
2008
Springer
13 years 10 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck