Sciweavers

4403 search results - page 198 / 881
» Galois Theory of Algorithms
Sort
View
CP
2008
Springer
15 years 8 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 8 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
ACL
2004
15 years 8 months ago
Using Linguistic Principles to Recover Empty Categories
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
Richard Campbell
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
CORR
2008
Springer
75views Education» more  CORR 2008»
15 years 6 months ago
Inductive and Coinductive Components of Corecursive Functions in Coq
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for c...
Yves Bertot, Ekaterina Komendantskaya