Sciweavers

10156 search results - page 24 / 2032
» Step by Step to Histories
Sort
View
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
14 years 2 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton
ALT
2009
Springer
14 years 1 months ago
The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses
In this paper the sequential prediction problem with expert advice is considered for the case when the losses of experts suffered at each step can be unbounded. We present some mo...
Vladimir V. V'yugin
STACS
1999
Springer
14 years 22 days ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy
PLSA
1994
14 years 17 days ago
Technological Steps toward a Software Component Industry
A machine_independent abstract program representation is presented that is twice as compact as machine code for a CISC processor. It forms the basis of an implementation, in which ...
Michael Franz
ECAI
2008
Springer
13 years 10 months ago
Automatic Configuration of Multi-Robot Systems: Planning for Multiple Steps
We consider multi-robot systems where robots need to cooperate tightly by sharing functionalities with each other. There are methods for automatically configuring a multi-robot sys...
Robert Lundh, Lars Karlsson, Alessandro Saffiotti