Sciweavers

2925 search results - page 17 / 585
» Information Complexity of Online Problems
Sort
View
IJCAI
1989
15 years 3 months ago
Reconstructive Explanation: Explanation as Complex Problem Solving
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
Michael R. Wick, William B. Thompson
ETFA
2008
IEEE
15 years 8 months ago
Optimal on-line (m, k)-firm constraint assignment for real-time control tasks based on plant state information
1 In this paper, we study the problem of scheduling a set of control tasks. We distinguish three different situations of states of controlled plants: not activated, steady state si...
Felicioni Flavia, Jia Ning, Françoise Simon...
142
Voted
COMPENG
2010
178views Algorithms» more  COMPENG 2010»
14 years 8 months ago
Online Distributed Interdependency Estimation with Partial Information Sharing
Infrastructures are becoming more and more interoperable, while stakeholders are not aware of the overall behavior. In order achieve a global awareness, in this paper the need for ...
Andrea Gasparri, Francesco Iovino, Gabriele Oliva,...
ESWS
2005
Springer
15 years 7 months ago
Towards Semantically-Interlinked Online Communities
Online community sites have replaced the traditional means of keeping a community informed via libraries and publishing. At present, online communities are islands that are not int...
John G. Breslin, Andreas Harth, Uldis Bojars, Stef...
CRV
2009
IEEE
153views Robotics» more  CRV 2009»
15 years 8 months ago
Optimal Online Data Sampling or How to Hire the Best Secretaries
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
Yogesh Girdhar, Gregory Dudek