Sciweavers

2027 search results - page 2 / 406
» When is it best to best-respond
Sort
View
ICPR
2002
IEEE
13 years 10 months ago
Determining a Suitable Metric when Using Non-Negative Matrix Factorization
The Non-negative Matrix Factorization technique (NMF) has been recently proposed for dimensionality reduction. NMF is capable to produce a region- or partbased representation of o...
David Guillamet, Jordi Vitrià
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 6 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
AAAI
2007
13 years 7 months ago
Best-First AND/OR Search for Graphical Models
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
Radu Marinescu 0002, Rina Dechter
CPC
2008
112views more  CPC 2008»
13 years 5 months ago
When is an Almost Monochromatic K4 Guaranteed?
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
Alexandr V. Kostochka, Dhruv Mubayi
WSC
1998
13 years 6 months ago
Comparison of Bayesian and Frequentist Assessments of Uncertainty for Selecting the Best System
An important problem in discrete-event stochastic simulation is the selection of the best system from a finite set of alternatives. There are many techniques for ranking and selec...
Koichiro Inoue, Stephen E. Chick