Optimizing and focusing search and results ranking in P2P networks becomes more and more important with the increasing size of these networks. Even though a few approaches have al...
Paul-Alexandru Chirita, Wolfgang Nejdl, Oana Scurt...
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...