282 search results - page 18 / 57 » Efficient bundle sorting |
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
TVCG
2008
13 years 7 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
PICS
1998
13 years 8 months ago
1998
This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scalar data. Instead o...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...
PODS
2001
ACM
14 years 7 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...