254 search results - page 3 / 51 » Graph Algorithms for Improving Type-Logical Proof Search |
111
Voted
AAAI
1996
15 years 4 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
117
Voted
ICWS
2007
IEEE
15 years 4 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
110
Voted
ALGORITHMICA
2004
15 years 2 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
120
Voted
SPIN
2009
Springer
15 years 9 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
126
Voted
LION
2009
Springer
15 years 9 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...