1454 search results - page 5 / 291 » Learning with cost intervals |
SIROCCO
1998
13 years 8 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
MICAI
2007
Springer
14 years 1 months ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
4OR
2005
13 years 7 months ago
2005
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...