Sciweavers

1260 search results - page 77 / 252
» Bipolar Preference Problems
Sort
View
FLAIRS
2004
13 years 11 months ago
Package Planning with Graphical Models
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...
Yang Xiang, Michael Janzen
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 10 months ago
Algorithmic Pricing via Virtual Valuations
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 ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg
CIKM
2009
Springer
14 years 4 months ago
A general magnitude-preserving boosting algorithm for search ranking
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....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
14 years 4 months ago
Timing-driven placement based on monotone cell ordering constraints
− 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...
Chanseok Hwang, Massoud Pedram
VISUALIZATION
1999
IEEE
14 years 2 months ago
Tensorlines: Advection-Diffusion Based Propagation through Diffusion Tensor Fields
Tracking linear features through tensor field datasets is an open research problem with widespread utility in medical and engineering disciplines. Existing tracking methods, which...
David M. Weinstein, Gordon L. Kindlmann, Eric C. L...