729 search results - page 107 / 146 » Solving subgraph isomorphism problems with constraint progra... |
132
click to vote
SIAMJO
2000
15 years 3 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
109
click to vote
ISSTA
2006
ACM
15 years 9 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
134
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
132
click to vote
BMCBI
2010
15 years 4 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...
143
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...