54 search results - page 2 / 11 » Solving The Multi-Constrained Path Selection Problem By Usin... |
AAAI
1996
13 years 9 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
MP
2008
13 years 7 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
ISSTA
1998
ACM
13 years 12 months ago
1998
ACM
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...