Sciweavers

4565 search results - page 111 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 function testbed
The BFGS quasi-Newton method is benchmarked on the noiseless BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of 105 times the sea...
Raymond Ros
ACL
1990
13 years 11 months ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
Raymond Ros
ICALP
2005
Springer
14 years 3 months ago
Optimal In-place Sorting of Vectors and Records
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
Gianni Franceschini, Roberto Grossi
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 10 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica