Sciweavers

305 search results - page 20 / 61
» Decidability of Split Equivalence
Sort
View
SIAMJO
2010
135views more  SIAMJO 2010»
13 years 6 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
JSYML
2008
63views more  JSYML 2008»
13 years 7 months ago
Classifying model-theoretic properties
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
Chris J. Conidis
LICS
2009
IEEE
14 years 2 months ago
Statistic Analysis for Probabilistic Processes
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
Michel de Rougemont, Mathieu Tracol
IJBC
2002
109views more  IJBC 2002»
13 years 7 months ago
Cnn Dynamics represents a Broader Class than PDES
The relationship between Cellular Nonlinear Networks (CNNs) and Partial Differential Equations (PDEs) is investigated. The equivalence between discrete-space CNN models and contin...
Marco Gilli, Tamás Roska, Leon O. Chua, Pie...
ACL
1998
13 years 9 months ago
Optimal Multi-Paragraph Text Segmentation by Dynamic Programming
There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragra...
Oskari Heinonen