Sciweavers

12950 search results - page 130 / 2590
» On Optimal Timed Strategies
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
INFOCOM
2011
IEEE
14 years 7 months ago
Delay-bounded adaptive UFH-based anti-jamming wireless communication
—Anti-jamming communication without pre-shared secrets has gained increasing research interest recently and is commonly tackled by utilizing the technique of uncoordinated freque...
Qian Wang, Ping Xu, Kui Ren, Xiang-yang Li
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 10 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
ICALP
2007
Springer
15 years 10 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
INFOCOM
2009
IEEE
15 years 10 months ago
Delay-Limited Cooperative Communication with Reliability Constraints in Wireless Networks
Abstract—We investigate optimal resource allocation for delaylimited cooperative communication in time varying wireless networks. Motivated by real-time applications that have st...
Rahul Urgaonkar, Michael J. Neely