10271 search results - page 377 / 2055 » Computer Science |
108
click to vote
GI
2007
Springer
15 years 8 months ago
2007
Springer
: Assisting everyday life is one major intent of ubiquitous computing (UbiComp). In addition, a given UbiComp infrastructure can be harnessed beyond assisting and helping people in...
128
click to vote
CCA
2005
Springer
15 years 6 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
111
click to vote
CSE
2009
IEEE
15 years 11 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...
STACS
2007
Springer
15 years 10 months 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 ...
132
click to vote
FOCS
2006
IEEE
15 years 10 months 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...