694 search results - page 66 / 139 » Open Graphs and Computational Reasoning |
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
SC
2003
ACM
14 years 3 months ago
2003
ACM
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
HUC
1999
Springer
14 years 2 months ago
1999
Springer
Many novel applications take on the task of moving the personal computer away from the desktop with the approach to merge digital information with physical space and objects. These...
IEEEHPCS
2010
13 years 8 months ago
2010
The performance (in term of error rate) of biometric systems can be improved by combining them. Multiple fusion techniques can be applied from classical logical operations to more...
LPAR
2004
Springer
14 years 3 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...