1705 search results - page 36 / 341 » Representing Constraints with Automata |
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
ENTCS
2008
13 years 7 months ago
2008
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for d...
IJCAI
1993
13 years 9 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
CC
2004
Springer
14 years 1 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
FSTTCS
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...