In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions around the agent, and determine the best direction that avoids the nearby obstacles, leading to a moving target which is assumed to be escap...

Recently, exploratory search has received much attention in information retrieval and database fields. This search paradigm assists users who do not have a clear search intent and are unfamiliar with the underlying data space. Specifically, query formulation evolves iteratively as the user becomes more familiar with the content. Despite its growing importance, exploratory search on graph-struct...

The polygon search problem is the problem of searching a mobile intruder in a polygonal region by a mobile searcher with various visibility. The k-searcher is a mobile guard whose visibility is limited to k rays emanating from his position, where the directions of the rays can be changed continuously with bounded angular rotation speed. It has been conjectured (see [9]) that the 2-searcher has ...

Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we present the results of an experimental evaluation of a new algorithm named Lingo. We use Open Directory Project as a source of high-quality narrowtopic document references and mix them into several multi-topic test sets for th...

Abstract: A previous analysis of second-order behavior of pattern search algorithms for unconstrained and linearly constrained minimization is extended to the more general class of mesh adaptive direct search (MADS) algorithms for general constrained optimization. Because of the ability of MADS to generate an asymptotically dense set of search directions, we are able to establish reasonable con...

The High Resolution Fly’s Eye HiRes-I detector has now been in operation in monocular mode for over six years. During that time span, HiRes-I has accumulated a larger exposure to Ultra-High Energy Cosmic Rays (UHECRs) above 10 eV than any other experiment built to date. This presents an unprecedented opportunity to search for anisotropy in the arrival directions of UHECRs. We present results of...

The irregular strip packing problem asks to place a set of polygons within a rectangular strip of fixed height without overlap, so as to minimize the strip width required. We consider an overlap minimization problem which minimizes the amount of overlap penalty for all pairs of polygons within a given bound of strip width. We propose a local search algorithm which translates a polygon in horizo...

In this paper, a new kind of nonmontone line search method which is called new hybrid projection method with perturbations is proposed. At the same time, global convergence of this kind of method is proved only in the case where the gradient function is uniformly continuous on an open convex set containing the iteration sequence. In doing so, we remove various boundedness conditions. Furthermor...

The goal of the TREC Federated Web Search track is to promote research related to federated search, in a realistic web setting. This overview paper discusses the main results of the FedWeb 2013 track. In this first year of the track, we focused on basic challenges in federated search: (1) resource selection, and (2) results merging. After an overview of the provided data collection and the rele...

This paper presents a user survey-based analysis of the correlation between the users’ willingness to personalize Web search and their social network usage patterns. The participants’ responses to the survey questions enabled us to use a regression model for identifying the relationship between SNS variables and willingness to personalize Web search; the obtained results show that there is a st...