Sciweavers

873 search results - page 56 / 175
» Tournament scoring problem
Sort
View
AAAI
2007
15 years 2 months ago
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
Colin McMillen, Manuela M. Veloso
AAAI
2006
15 years 1 months ago
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
Rama Akkiraju, Biplav Srivastava, Anca-Andreea Iva...
PVLDB
2010
84views more  PVLDB 2010»
14 years 10 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 10 months ago
Querying spatial patterns
Spatial data are common in many scientific and commercial domains such as geographical information systems and gene/protein expression profiles. Querying for distribution patterns...
Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Si...
NAACL
2010
14 years 9 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes