Sciweavers

JSA
2000
175views more  JSA 2000»
13 years 10 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
CCCG
2003
14 years 8 days ago
On shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
Telikepalli Kavitha, Kasturi R. Varadarajan
GECCO
2009
Springer
127views Optimization» more  GECCO 2009»
14 years 3 months ago
BBOB-benchmarking the Rosenbrock's local search algorithm
The restarted Rosenbrock’s optimization algorithm is tested on the BBOB 2009 testbed. The algorithm turned out to be very efficient for functions with simple structure (independ...
Petr Posik