592 search results - page 90 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
128
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
106
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
122
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
135
Voted
TAPSOFT
1995
Springer
15 years 6 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
117
click to vote
ICCAD
2002
IEEE
15 years 11 months ago
2002
IEEE
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...