2266 search results - page 169 / 454 » Some Solutions to the Ignoring Problem |
161
click to vote
MKM
2005
Springer
16 years 1 days ago
2005
Springer
In this contribution we address two related questions. Firstly, we want to shed light on the question how to use a representation formalism to represent a given problem. Secondly, ...
201
click to vote
WABI
2005
Springer
2005
Springer
Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event
16 years 16 hour ago
Abstract. The haplotype inference (HI) problem is the problem of inferring 2n haplotype pairs from n observed genotype vectors. This is a key problem that arises in studying geneti...
156
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
176
click to vote
GOSLER
1995
15 years 10 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
181
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...