Sciweavers

3775 search results - page 241 / 755
» The Expression Problem Revisited
Sort
View
SLOGICA
2010
138views more  SLOGICA 2010»
15 years 3 months ago
Extensionality and Restriction in Naive Set Theory
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Zach Weber
GECCO
2009
Springer
164views Optimization» more  GECCO 2009»
15 years 2 months ago
Solving iterated functions using genetic programming
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
Michael D. Schmidt, Hod Lipson
ICDAR
2009
IEEE
15 years 2 months ago
Issues in Performance Evaluation: A Case Study of Math Recognition
Performance evaluation of document recognition systems is a difficult and practically important problem. Issues arise in defining requirements, in characterizing the system's...
Adrien Lapointe, Dorothea Blostein
ICFEM
2009
Springer
15 years 2 months ago
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
Jiri Barnat, Lubos Brim, Petr Rockai
ACL
2011
14 years 8 months ago
Word Alignment via Submodular Maximization over Matroids
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
Hui Lin, Jeff Bilmes