1603 search results - page 34 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
CEC
2009
IEEE
15 years 1 months ago
2009
IEEE
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
NIPS
2007
14 years 11 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
CVPR
2004
IEEE
15 years 1 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
105
click to vote
ADBIS
2010
Springer
14 years 11 months ago
2010
Springer
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...