Sciweavers

169 search results - page 24 / 34
» arcs 2007
Sort
View
IJCAI
1993
13 years 9 months ago
Quantifying Beliefs by Belief Functions: An Axiomatic Justification
: We present a set of axioms that justify the use of belief functions to quantify the beliefs held by an agent Y at time t and based on Y's evidential corpus. It is essentiall...
Philippe Smets
IJCAI
1989
13 years 9 months ago
Control of Refitting during Plan Reuse
In plan reuse, refitting is the process of modifying an existing plan to make it applicable to a new problem situation. An efficient refitting strategy needs to be conservative, i...
Subbarao Kambhampati, James A. Hendler
IJCAI
1989
13 years 9 months ago
Learning Novel Domains Through Curiosity and Conjecture
This paper describes DIDO, a system we have developed to carry out exploratory learning of unfamiliar domains without assistance from an external teacher. The program incorporates...
Paul D. Scott, Shaul Markovitch
MVA
1990
100views Computer Vision» more  MVA 1990»
13 years 9 months ago
A High Speed Word Matching Algorithm for Handwritten Chinese Character Recognition
A new high speed word matching algorithm for handwritten Chinese character recomition is presented. Acontinuous string without delimiting space is recognized in real time by using...
Katsumi Marukawa, Masashi Koga, Yoshihiro Shima, H...
4OR
2005
104views more  4OR 2005»
13 years 7 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella