971 search results - page 9 / 195 » Approximate Satisfiability and Equivalence |
COMBINATORICS
2006
13 years 9 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
CATS
2008
13 years 11 months ago
2008
Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose...
AAIM
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
TCS
2008
13 years 9 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
RANDOM
2001
Springer
14 years 2 months ago
2001
Springer
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...