738 search results - page 59 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
SAT
2005
Springer
15 years 3 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
UIST
2003
ACM
15 years 3 months ago
2003
ACM
People use their awareness of others' temporal patterns to plan work activities and communication. This paper presents algorithms for programatically detecting and modeling t...
104
click to vote
ANCS
2008
ACM
14 years 11 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
101
click to vote
ICCAD
2009
IEEE
14 years 7 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...