22018 search results - page 4146 / 4404 » or 2004 |
185
click to vote
COCO
2004
Springer
16 years 20 days ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
189
click to vote
COCO
2004
Springer
16 years 20 days ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
188
click to vote
COLT
2004
Springer
16 years 20 days ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
212
click to vote
CONCUR
2004
Springer
16 years 20 days ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
177
click to vote
COORDINATION
2004
Springer
16 years 20 days ago
2004
Springer
Abstract. We consider the question of how to establish and enforce communal policies for peer-to-peer (P2P) communities. Generally, members of each P2P community must conform to an...