Sciweavers

338 search results - page 22 / 68
» Locally checkable proofs
Sort
View
HUMO
2007
Springer
14 years 2 months ago
3D Hand Tracking in a Stochastic Approximation Setting
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
Desmond Chik, Jochen Trumpf, Nicol N. Schraudolph
JFPLC
2004
13 years 9 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
JOLLI
2002
141views more  JOLLI 2002»
13 years 7 months ago
Naming Worlds in Modal and Temporal Logic
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
Dov M. Gabbay, G. Malod
GECCO
2003
Springer
14 years 1 months ago
Quad Search and Hybrid Genetic Algorithms
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
L. Darrell Whitley, Deon Garrett, Jean-Paul Watson
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 2 months ago
Complexity and Error Propagation of Localization Using Interferometric Ranging
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
Rui Huang, Gergely V. Záruba, Manfred Huber