Sciweavers

13376 search results - page 396 / 2676
» Problem Solving with
Sort
View
ECML
1994
Springer
15 years 8 months ago
Industrial Applications of ML: Illustrations for the KAML Dilemma and the CBR Dream
This paperpresents several industrial applications of MLin the context of their effort to solve the "KAMLproblem", i.e., the problem of merging knowledge acquisition and...
Yves Kodratoff
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
15 years 11 months ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
COR
2007
106views more  COR 2007»
15 years 4 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
112
Voted
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 10 months ago
Minimum Distance Localization for a Robot with Limited Visibility
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
Malvika Rao, Gregory Dudek, Sue Whitesides
TABLEAUX
1999
Springer
15 years 9 months ago
The Non-Associative Lambek Calculus with Product in Polynomial Time
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem...
Philippe de Groote