Sciweavers

9405 search results - page 80 / 1881
» Computing a Model of Set Theory
Sort
View
JOOP
1998
86views more  JOOP 1998»
14 years 9 months ago
Prelude to a Theory of Void
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
Bertrand Meyer

Book
5396views
16 years 8 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li
CICLING
2005
Springer
15 years 3 months ago
A Computational Model of the Spanish Clitic System
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
Luis Alberto Pineda, Ivan V. Meza
CSL
2004
Springer
15 years 3 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...