Sciweavers

2925 search results - page 455 / 585
» Information Complexity of Online Problems
Sort
View
KSEM
2009
Springer
15 years 10 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
RAM
2008
IEEE
172views Robotics» more  RAM 2008»
15 years 10 months ago
VT Position Code Communication Technology and Its Implementation
Eelectronic device technology has been monopolized by binary system for many years. The circs not only makes it impossible to break through the existing technology bottleneck, but...
ShiYing Zhou, GuiHe Qin, YuBo Jin
ADC
2008
Springer
139views Database» more  ADC 2008»
15 years 10 months ago
Computing Structural Similarity of Source XML Schemas against Domain XML Schema
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Jixue Liu...