Sciweavers

4007 search results - page 161 / 802
» Computation with imprecise probabilities
Sort
View
128
Voted
TEC
2010
173views more  TEC 2010»
14 years 10 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
137
Voted
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 7 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
126
Voted
CGA
1999
15 years 3 months ago
Vector Geometry for Computer Graphics
translating your abstract notions of desired size and shape directly into the appropriate tugs and pulls. You would probably not think much about coordinate systems. Ifyouwantedtom...
James R. Miller
163
Voted
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 6 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
136
Voted
IPPS
2005
IEEE
15 years 9 months ago
Predicting Cache Space Contention in Utility Computing Servers
The need to provide performance guarantee in high performance servers has long been neglected. Providing performance guarantee in current and future servers is difficult because ...
Yan Solihin, Fei Guo, Seongbeom Kim