Sciweavers

219 search results - page 20 / 44
» Solving Semi-infinite Linear Programs Using Boosting-Like Me...
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 11 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
TROB
2010
129views more  TROB 2010»
13 years 6 months ago
A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
Lars Blackmore, Masahiro Ono, Askar Bektassov, Bri...
EMNLP
2009
13 years 5 months ago
Graph Alignment for Semi-Supervised Semantic Role Labeling
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
Hagen Fürstenau, Mirella Lapata
ICASSP
2009
IEEE
13 years 11 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici