Sciweavers

380 search results - page 39 / 76
» Mapping Problems with Finite-Domain Variables into Problems ...
Sort
View
ICPR
2000
IEEE
14 years 9 hour ago
Generalized Non-Reducible Descriptors
This paper provides a generalization of non-reducible descriptors by extending the concept of distance between patterns of di erent classes. Generalized non-reducible descriptors ...
Ventzeslav Valev, Bülent Sankur, Petia Radeva
IWSSD
2000
IEEE
13 years 12 months ago
Hybrid Model Visualization in Requirements and Design: A Preliminary Investigation
This paper reports on a preliminary investigation into applying work on graphic animation of behavioral models to an air traffic control case study – the National Air Traffic Se...
Jeff Magee, Jeff Kramer, Bashar Nuseibeh, David Bu...
TCS
2008
13 years 7 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
13 years 11 months ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios
IBERAMIA
2004
Springer
14 years 1 months ago
Statistical Inference in Mapping and Localization for Mobile Robots
In this paper we tackle the problem of providing a mobile robot with the ability to build a map of its environment using data gathered during navigation. The data correspond to the...
Anita Araneda, Alvaro Soto