1615 search results - page 295 / 323 » Computer science and decision theory |
146
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
165
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
140
click to vote
CF
2005
ACM
15 years 6 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
150
click to vote
IJFCS
2006
15 years 4 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
146
click to vote
GI
2004
Springer
15 years 9 months ago
2004
Springer
: Since the advent of Gnutella, Peer-to-Peer (P2P) protocols have matured towards a fundamental design element for large-scale, self-organising distributed systems. Many research e...