Sciweavers

1705 search results - page 66 / 341
» Representing Constraints with Automata
Sort
View
CP
2005
Springer
14 years 3 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen
ECAI
2004
Springer
14 years 3 months ago
Uncertain Linear Constraints
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying many AI uncertainty for...
Nic Wilson
AAAI
2010
13 years 11 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
LATA
2009
Springer
14 years 4 months ago
Decision Problems for Convex Languages
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 4 months ago
Isomorphism of regular trees and words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
Markus Lohrey, Christian Mathissen