Sciweavers

3328 search results - page 522 / 666
» On Plateaued Functions and Their Constructions
Sort
View
COMPGEOM
2006
ACM
15 years 8 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
CSL
2008
Springer
15 years 8 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
DEXA
2008
Springer
123views Database» more  DEXA 2008»
15 years 8 months ago
Evolutionary Clustering in Description Logics: Controlling Concept Formation and Drift in Ontologies
Abstract. We present a method based on clustering techniques to detect concept drift or novelty in a knowledge base expressed in Description Logics. The method exploits an effectiv...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
DLS
2008
165views Languages» more  DLS 2008»
15 years 8 months ago
Filtered dispatch
Predicate dispatching is a generalized form of dynamic dispatch, which has strong limitations when arbitrary predicates of the underlying base language are used. Unlike classes, w...
Pascal Costanza, Charlotte Herzeel, Jorge Vallejos...
ECOOP
2008
Springer
15 years 8 months ago
An Extensible State Machine Pattern for Interactive Applications
Abstract. The state design pattern is the standard object-oriented programming idiom for implementing the state machine logic of interactive applications. While this pattern provid...
Brian Chin, Todd D. Millstein