Sciweavers

4447 search results - page 559 / 890
» Model Checking Games
Sort
View
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
DSRT
2009
IEEE
15 years 10 months ago
An Approach for Parallel Interest Matching in Distributed Virtual Environments
—Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing inter...
Elvis S. Liu, Georgios K. Theodoropoulos
AI
2010
Springer
15 years 7 months ago
When is it better not to look ahead?
In situations where one needs to make a sequence of decisions, it is often believed that looking ahead will help produce better decisions. However, it was shown 30 years ago that ...
Dana S. Nau, Mitja Lustrek, Austin Parker, Ivan Br...
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 6 months ago
Competition of Wireless Providers for Atomic Users
We study a problem where wireless service providers compete for heterogenous and atomic (non-infinitesimal) wireless users. The users differ in their utility functions as well as ...
Vojislav Gajic, Jianwei Huang, Bixio Rimoldi
IOR
2007
119views more  IOR 2007»
15 years 6 months ago
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
Alfredo Garcia, Stephen D. Patek, Kaushik Sinha