10848 search results - page 1805 / 2170 » Programming in Biomolecular Computation |
186
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
174
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
177
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
192
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
174
click to vote
UM
2001
Springer
15 years 11 months ago
2001
Springer
In an experimental environment, we simulated the situation of a user who gives speech input to a system while walking through an airport. The time pressure on the subjects and the ...