4007 search results - page 378 / 802 » Computation with imprecise probabilities |
172
click to vote
CSCWD
2008
Springer
15 years 8 months ago
2008
Springer
Traditionally, collaborative systems have been difficult to conceive, design and implement. Although several requirements involved in these products are recurrent, some become inv...
192
Voted
EUC
2008
Springer
15 years 8 months ago
2008
Springer
This paper studies the scheduling and assignment problem that minimizes the total energy including both dynamic and leakage energy for applications with loops on multi-voltage, mul...
166
click to vote
NIPS
2007
15 years 8 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
176
click to vote
UAI
2008
15 years 8 months ago
2008
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
165
Voted
AAAI
2004
15 years 8 months ago
2004
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...