Sciweavers

1080 search results - page 186 / 216
» Problem dependent optimization (PDO)
Sort
View
AAAI
2006
15 years 5 months ago
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Yaxin Liu, Sven Koenig
AAAI
2006
15 years 5 months ago
Boosting Expert Ensembles for Rapid Concept Recall
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
ICHIM
2001
139views more  ICHIM 2001»
15 years 5 months ago
Automated 3D Recording of Archaeological Pottery
At excavations a large number of sherds of archaeological pottery is found. Since the documentation and administration of these fragments represent a temporal and personnel effort...
Martin Kampel, Robert Sablatnig
PST
2004
15 years 5 months ago
Determining Internet Users' Values for Private Information
We examine the problem of determining a user's value for his/her private information. Web businesses often offer rewards, such as discounts, free downloads and website persona...
Scott Buffett, Nathan Scott, Bruce Spencer, Michae...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 5 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák