13090 search results - page 2349 / 2618 » Usable artificial intelligence |
168
Voted
LATA
2009
Springer
16 years 1 months ago
2009
Springer
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 ...
182
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
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...
196
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
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...
152
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
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...
173
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
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 ...