1260 search results - page 77 / 252 » Bipolar Preference Problems |
136
Voted
FLAIRS
2004
15 years 3 months ago
2004
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
92
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
126
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
128
Voted
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
116
click to vote
VISUALIZATION
1999
IEEE
15 years 6 months ago
1999
IEEE
Tracking linear features through tensor field datasets is an open research problem with widespread utility in medical and engineering disciplines. Existing tracking methods, which...