Sciweavers

295 search results - page 23 / 59
» SAT, SMT and Applications
Sort
View
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
15 years 5 months ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
CSL
2004
Springer
15 years 5 months ago
Unsound Theorem Proving
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Christopher Lynch
LREC
2010
119views Education» more  LREC 2010»
15 years 1 months ago
Towards Improving English-Latvian Translation: A System Comparison and a New Rescoring Feature
This paper presents a comparative study of two alternative approaches to statistical machine translation (SMT) and their application to a task of English-to-Latvian translation. F...
Maxim Khalilov, José A. R. Fonollosa, Ingun...
SODA
2004
ACM
151views Algorithms» more  SODA 2004»
15 years 1 months ago
Minimum moment Steiner trees
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
Wangqi Qiu, Weiping Shi
JSAT
2006
114views more  JSAT 2006»
14 years 11 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos