2925 search results - page 108 / 585 » Information Complexity of Online Problems |
170
click to vote
ECSQARU
2009
Springer
16 years 29 days ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
174
click to vote
GRID
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
144
click to vote
JSSPP
2005
Springer
15 years 12 months ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
162
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
157
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...