3678 search results - page 152 / 736 » On the Stable Paths Problem |
162
Voted
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
137
Voted
AAAI
2004
15 years 5 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
128
Voted
CN
2004
15 years 3 months ago
2004
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
129
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
113
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...