Sciweavers

2040 search results - page 38 / 408
» Approximate Expectation Maximization
Sort
View
CPC
2007
61views more  CPC 2007»
14 years 11 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus
GLOBECOM
2008
IEEE
15 years 5 months ago
Maximizing Transport Capacity for Geographic Transmission on Nakagami-m Channels
—In mobile ad hoc networks (MANETs), conventional packet forwarding schemes that pre-select the next-hop receivers for a packet may fail if the channel coherence time is on the o...
Tathagata D. Goswami, John M. Shea, Tan F. Wong, M...
NIPS
2003
15 years 20 days ago
Eye Movements for Reward Maximization
Recent eye tracking studies in natural tasks suggest that there is a tight link between eye movements and goal directed motor actions. However, most existing models of human eye m...
Nathan Sprague, Dana H. Ballard
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
15 years 4 months ago
Maximally rugged NK landscapes contain the highest peaks
NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima...
Benjamin Skellett, Benjamin Cairns, Nicholas Geard...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
15 years 12 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...