146 search results - page 10 / 30 » SAT-Based Complete Don't-Care Computation for Network Optimi... |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
SPAA
2009
ACM
14 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
Many processes in the cell involve interaction among the proteins and determination of the networks of such interactions is of immense importance towards the complete understanding...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
SLIP
2006
ACM
14 years 1 months ago
2006
ACM
At every stage in physical design, engineers are faced with many different objectives and tools to develop, optimize, and evaluate their design. Each choice of a tool or an objec...