Sciweavers

2027 search results - page 18 / 406
» When is it best to best-respond
Sort
View
AIPS
2009
13 years 11 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
CONCURRENCY
2006
77views more  CONCURRENCY 2006»
13 years 10 months ago
A survey of systems for detecting serial run-time errors
: This paper evaluates the ability of a variety of commercial and non-commercial software products to detect serial run-time errors in C and C++ programs, to issue meaningful messa...
Glenn R. Luecke, James Coyle, Jim Hoekstra, Marina...
INFOCOM
2007
IEEE
14 years 4 months ago
Losing Opportunism: Evaluating Service Integration in an Opportunistic Wireless System
Abstract— In this paper we evaluate interactions among flowlevel performance metrics when integrating QoS and best effort flows in a wireless system using opportunistic schedul...
Hongseok Kim, Gustavo de Veciana
COLT
2010
Springer
13 years 8 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
EUROPAR
2000
Springer
14 years 1 months ago
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
Alain Darte, Claude G. Diderich, Marc Gengler, Fr&...