8413 search results - page 263 / 1683 » Ordering Problem Subgoals |
119
click to vote
ICTAI
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
111
click to vote
ACSD
2006
IEEE
15 years 9 months ago
2006
IEEE
— When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into small...
106
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
125
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
117
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...