Sciweavers

2109 search results - page 252 / 422
» Solving Necklace Constraint Problems
Sort
View
CP
2007
Springer
16 years 6 days ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
PADL
2007
Springer
16 years 5 days ago
From Zinc to Design Model
We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically...
Reza Rafeh, Maria J. García de la Banda, Ki...
ICRA
2005
IEEE
132views Robotics» more  ICRA 2005»
15 years 11 months ago
Handling the Inconsistency of Relative Map Filter
— In [5], a version of Relative Map Filter (RMF) is proposed to solve the simultaneous localization and map building (SLAM) problem. In the RMF, the map states contain only quant...
Viet Nguyen, Agostino Martinelli, Roland Siegwart
DATE
2010
IEEE
168views Hardware» more  DATE 2010»
15 years 10 months ago
Verifying UML/OCL models using Boolean satisfiability
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
Mathias Soeken, Robert Wille, Mirco Kuhlmann, Mart...
SPIRE
1999
Springer
15 years 10 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong