1425 search results - page 281 / 285 » Beyond Dependency Graphs |
81
Voted
SIROCCO
2010
14 years 11 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
PDPTA
2000
14 years 11 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
114
click to vote
WOTUG
2007
14 years 10 months ago
2007
Concurrency control mechanisms such as turn-taking, locking, serialization, transactional locking mechanism, and operational transformation try to provide data consistency when con...
ASUNAM
2010
IEEE
14 years 9 months ago
2010
IEEE
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...
108
click to vote
AI
2010
Springer
14 years 9 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...