81 search results - page 16 / 17 » A Shortest Learning Path Selection Algorithm in E-learning |
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
RAS
2006
13 years 5 months ago
2006
Mobile robots must cope with uncertainty from many sources along the path from interpreting raw sensor inputs to behavior selection to execution of the resulting primitive actions...
FUZZIEEE
2007
IEEE
13 years 12 months ago
2007
IEEE
— The real time flexible operation of a car-like mobile robot with nonholonomic constraints in dynamic environment is still a very challenging problem. The difficulty lies in t...
CN
2006
13 years 5 months ago
2006
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
ECML
2005
Springer
13 years 11 months ago
2005
Springer
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...