1984 search results - page 249 / 397 » The colourful feasibility problem |
169
click to vote
ESANN
2004
15 years 7 months ago
2004
Many existing researches utilized many different approaches for recognition in digital mammography using various ANN classifier-modeling techniques. Different types of feature extr...
161
click to vote
UAI
1998
15 years 7 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
228
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper explores the realization of robotic arm motion planning, especially Findpath Problem, which is a basic motion planning problem that arises in the development of robotic...
206
click to vote
AIPS
2009
15 years 7 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
165
click to vote
BPM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. A configurable process model describes a family of similar process models in a given domain. Such a model can be configured to obtain a specific process model that is sub...