10271 search results - page 266 / 2055 » Self-plagiarism in computer science |
208
click to vote
WG
2005
Springer
16 years 23 days ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
173
click to vote
GI
2003
Springer
16 years 15 days ago
2003
Springer
Abstract: P2P Meeting Tool is a meeting management tool, which uses Peer-toPeer technology to realise a pervasive computing environment. Users can search for and join a meeting ses...
173
click to vote
GI
2009
Springer
15 years 5 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:...
166
click to vote
CSE
2009
IEEE
16 years 2 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...
141
click to vote
STACS
2007
Springer
16 years 1 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 ...