10890 search results - page 1839 / 2178 » Automatic Complexity Analysis |
201
click to vote
MOBICOM
2004
ACM
16 years 2 days ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
124
click to vote
PASTE
2004
ACM
16 years 2 days ago
2004
ACM
Many software testing and automated debugging tools rely on structural coverage techniques. Such tools implicitly assume a relation between individual control-flow choices made i...
162
click to vote
SIGECOM
2004
ACM
16 years 1 days ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
157
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
157
click to vote
ATAL
2004
Springer
16 years 1 days ago
2004
Springer
The process of pair partnership formation is an important infrastructure for many plausible MAS applications. Each agent evaluates potential partner agents, where each potential m...