—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Abstract: In this paper, we revisit our approach to construction of semanticlinguistic Feature Vectors (FVs) used to enhance Web search. These FVs are built based on domain semanti...
The purpose of this contribution is twofold: 1) to present for the first time a Lyapunov function that proves exponential ergodicity of a process studied by the authors in [1], whe...
Many databases have become Web-accessible through form-based search interfaces (i.e., search forms) that allow users to specify complex and precise queries to access the underlying...