Sciweavers

4066 search results - page 47 / 814
» Almost Complete Sets
Sort
View
BMCBI
2007
161views more  BMCBI 2007»
13 years 10 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
ATAL
2007
Springer
14 years 4 months ago
Eliciting single-peaked preferences using comparison queries
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
Vincent Conitzer
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 5 months ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
SOFSEM
2012
Springer
12 years 5 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
TLCA
2009
Springer
14 years 4 months ago
On the Meaning of Logical Completeness
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
Michele Basaldella, Kazushige Terui