7228 search results - page 409 / 1446 » From Algorithmic to Subjective Randomness |
239
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
183
click to vote
RECSYS
2009
ACM
16 years 1 months ago
2009
ACM
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ļ¬...
211
Voted
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we present an advanced bidding agent that participates in ļ¬rst-price sealed bid auctions to allocate advertising space on BluScreen ā an experimental public adve...
182
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
We deļ¬ne two new classes of shared-memory objects: ratiļ¬ers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
175
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We propose a network characterization of combinatorial ļ¬tness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...