2926 search results - page 290 / 586 » Partially Optimal Routing |
130
click to vote
AIMSA
2004
Springer
15 years 7 months ago
2004
Springer
In: Proceedings of the Eleventh International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-04), Springer-Verlag LNAI Series. c 2004 We present ...
137
click to vote
AAAI
2008
15 years 6 months ago
2008
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
128
Voted
OPODIS
2008
15 years 5 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
126
click to vote
CIKM
2001
Springer
15 years 8 months ago
2001
Springer
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
108
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...