Sciweavers

20294 search results - page 369 / 4059
» Algorithmic Information Theory
Sort
View
213
Voted
ATAL
2011
Springer
14 years 6 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
DAC
2005
ACM
16 years 7 months ago
A non-parametric approach for dynamic range estimation of nonlinear systems
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm
190
Voted
WWW
2005
ACM
16 years 7 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
174
Voted
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 7 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
172
Voted
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul