10988 search results - page 266 / 2198 » Algorithmic Folding Complexity |
145
Voted
AAAI
1994
15 years 5 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
160
click to vote
IPM
2006
15 years 4 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
151
click to vote
CIBCB
2008
IEEE
15 years 10 months ago
2008
IEEE
— Molecular docking is an essential tool for drug design. It helps the scientist to rapidly know if two molecules, respectively called ligand and receptor, can be combined togeth...
124
Voted
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
— The complexity of Finite Impulse Response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. A greedy Common Subexp...
146
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...