Sciweavers

971 search results - page 38 / 195
» Planning with Reduced Operator Sets
Sort
View
IAT
2009
IEEE
15 years 4 months ago
Extending Alternating-Offers Bargaining in One-to-Many and Many-to-Many Settings
Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studie...
Bo An, Nicola Gatti, Victor R. Lesser
PR
2002
85views more  PR 2002»
14 years 9 months ago
An incremental prototype set building technique
This paper deals with the task of "nding a set of prototypes from the training set. A reduced set is obtained which is used instead of the training set when nearest neighbour...
V. Susheela Devi, M. Narasimha Murty
CADE
2010
Springer
14 years 11 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak
VLDB
2009
ACM
159views Database» more  VLDB 2009»
15 years 10 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 10 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro