Sciweavers

2111 search results - page 61 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CGO
2007
IEEE
15 years 4 months ago
Evaluating Heuristic Optimization Phase Order Search Algorithms
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson
ICPP
2006
IEEE
15 years 3 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm approach to the selection of near-optimal subsets from large sets
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
P. Whiting, P. W. Poon, J. N. Carter
TAPSOFT
1997
Springer
15 years 1 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
CEC
2010
IEEE
14 years 11 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius