Sciweavers

4679 search results - page 516 / 936
» Modeling When Connections Are the Problem
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
15 years 1 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
ICCV
2001
IEEE
16 years 8 months ago
Using Scene Constraints during the Calibration Procedure
This paper focuses on the problem of calibration from a single view and a map of a scene. This situation arises quite often when modelling urban scenes, e.g. for augmented reality...
Didier Bondyfalat, Théodore Papadopoulo, Be...
CADE
2005
Springer
16 years 7 months ago
Well-Nested Context Unification
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Jordi Levy, Joachim Niehren, Mateu Villaret
VMCAI
2010
Springer
16 years 4 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
16 years 1 months ago
Continuous path planning for a data harvesting mobile server
— We consider a queueing system composed of queues distributed at fixed locations in a continuous environment and a mobile server serving the jobs in the queues with spatially v...
Jerome Le Ny, Munther A. Dahleh, Eric Feron, Emili...