9888 search results - page 1868 / 1978 » compute 2009 |
201
click to vote
COCO
2009
Springer
16 years 29 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
182
click to vote
BTW
2009
Springer
16 years 29 days ago
2009
Springer
: Many model management tasks, e.g., schema matching or merging, require the manual handling of metadata. Given the diversity of metadata, its many different representations and mo...
169
click to vote
FSTTCS
2009
Springer
16 years 28 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
162
click to vote
AIPS
2009
15 years 7 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
181
click to vote
PERCOM
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...