60 search results - page 7 / 12 » The Connectivity of Boolean Satisfiability: Computational an... |
202
click to vote
ICCAD
2009
IEEE
15 years 3 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
157
click to vote
LOGCOM
2010
15 years 4 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
171
click to vote
GMP
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
147
click to vote
BIRTHDAY
2009
Springer
16 years 25 days ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
205
click to vote
DIGRA
2005
Springer
15 years 11 months ago
2005
Springer
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...