29908 search results - page 261 / 5982 » On the Complexity of |
165
click to vote
PODC
2005
ACM
16 years 7 days ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
174
click to vote
STOC
2005
ACM
16 years 7 days ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
190
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
227
click to vote
ISAAC
2005
Springer
16 years 5 days ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
148
click to vote
IVA
2005
Springer
16 years 5 days ago
2005
Springer
An important characteristic of a virtual human is the ability to direct its perceptual attention to entities and areas in a virtual environment in a manner that appears believable ...