Sciweavers

2925 search results - page 10 / 585
» Information Complexity of Online Problems
Sort
View
CI
2002
92views more  CI 2002»
15 years 1 months ago
Model Selection in an Information Economy: Choosing What to Learn
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
Christopher H. Brooks, Robert S. Gazzale, Rajarshi...
95
Voted
IJCAI
2003
15 years 3 months ago
Definition and Complexity of Some Basic Metareasoning Problems
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
Vincent Conitzer, Tuomas Sandholm
119
Voted
DELTA
2010
IEEE
15 years 12 days ago
(Some) Open Problems to Incorporate BIST in Complex Heterogeneous Integrated Systems
This paper presents an overview of test techniques that offer promising features when Built-In-Self-Test (BIST) must be applied to complex intgrated systems including analog, mixed...
Manuel J. Barragan Asian, Gloria Huertas, Adoraci&...
WWW
2008
ACM
16 years 2 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
15 years 8 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
Nikhil R. Devenur, Thomas P. Hayes