438 search results - page 37 / 88 » A (1-1 e)-approximation algorithm for the generalized assign... |
101
click to vote
PR
2000
15 years 3 months ago
2000
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
145
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
127
click to vote
SC
2000
ACM
15 years 7 months ago
2000
ACM
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
157
click to vote
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
121
click to vote
IJAR
2006
15 years 3 months ago
2006
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...