10447 search results - page 404 / 2090 » The Philosophy of Computer Science |
158
Voted
GI
2009
Springer
15 years 4 months ago
2009
Springer
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
157
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
132
Voted
STACS
2007
Springer
16 years 29 days ago
2007
Springer
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
169
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
183
click to vote
ACSC
2005
IEEE
16 years 14 days ago
2005
IEEE
This paper introduces a novel approach towards direct interaction with large display systems. Monocular computer vision is utilised to avoid restraints imposed by input devices. T...