12825 search results - page 304 / 2565 » Improved PLSOM algorithm |
164
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
187
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
152
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
163
click to vote
IJHPCN
2008
15 years 7 months ago
2008
: We propose a set of statistical metrics for making a comprehensive, fair, and insightful evaluation of features, clustering algorithms, and distance measures in representative sa...
187
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...