Sciweavers

12950 search results - page 195 / 2590
» On Optimal Timed Strategies
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
AIR
2004
111views more  AIR 2004»
15 years 4 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
PVLDB
2008
122views more  PVLDB 2008»
15 years 3 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
AIPS
2004
15 years 5 months ago
Price Prediction Strategies for Market-Based Scheduling
In a market-based scheduling mechanism, the allocation of time-specific resources to tasks is governed by a competitive bidding process. Agents bidding for multiple, separately al...
Jeffrey K. MacKie-Mason, Anna Osepayshvili, Daniel...
HT
2009
ACM
15 years 11 months ago
Improving recommender systems with adaptive conversational strategies
Conversational recommender systems (CRSs) assist online users in their information-seeking and decision making tasks by supporting an interactive process. Although these processes...
Tariq Mahmood, Francesco Ricci