Sciweavers

3602 search results - page 111 / 721
» Isn't It About Time
Sort
View
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
14 years 1 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
RSP
1999
IEEE
116views Control Systems» more  RSP 1999»
14 years 1 months ago
Performance Analysis of a RTOS by Emulation of an Embedded System
This paper analyzes the performance of two different real-time operating systems. Therefore, we used a real benchmark embedded system design with fast external reaction times of a...
Karlheinz Weiß, Thorsten Steckstor, Wolfgang...
CAIP
2007
Springer
125views Image Analysis» more  CAIP 2007»
14 years 1 months ago
Euclidean Shortest Paths in Simple Cube Curves at a Glance
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
Fajie Li, Reinhard Klette
ICAIL
2007
ACM
14 years 28 days ago
Variants of temporal defeasible logics for modelling norm modifications
This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for ...
Guido Governatori, Antonino Rotolo, Régis R...
KR
1991
Springer
14 years 17 days ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...