264 search results - page 25 / 53 » On the possibility of faster SAT algorithms |
63
Voted
IJAR
2010
14 years 7 months ago
2010
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...
106
Voted
ICPP
2005
IEEE
15 years 3 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
BMCBI
2010
14 years 10 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
105
Voted
FCCM
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
90
Voted
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...