10304 search results - page 420 / 2061 » Computer science with the sciences: an emphasis in computati... |
194
Voted
WG
2005
Springer
16 years 10 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...
157
click to vote
GI
2003
Springer
16 years 2 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...
142
Voted
GI
2007
Springer
15 years 10 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...
164
click to vote
CCA
2005
Springer
15 years 8 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...
158
click to vote
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:...