Sciweavers

12993 search results - page 2327 / 2599
» Artificial Intelligence in China
Sort
View
100
Voted
LATA
2009
Springer
15 years 7 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana
98
Voted
LATA
2009
Springer
15 years 7 months ago
Matching Trace Patterns with Regular Policies
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
Franz Baader, Andreas Bauer 0002, Alwen Tiu
LATA
2009
Springer
15 years 7 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
92
Voted
ISMVL
2009
IEEE
107views Hardware» more  ISMVL 2009»
15 years 7 months ago
Regular Encodings from Max-CSP into Partial Max-SAT
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
Josep Argelich, Alba Cabiscol, Inês Lynce, F...
113
Voted
ISMVL
2009
IEEE
124views Hardware» more  ISMVL 2009»
15 years 7 months ago
Equivalence Checking of Reversible Circuits
Determining the equivalence of reversible circuits designed to meet a common specification is considered. The circuits’ primary inputs and outputs must be in pure logic states ...
Robert Wille, Daniel Große, D. Michael Mille...
« Prev « First page 2327 / 2599 Last » Next »