نتایج جستجو برای: forward search procedure
تعداد نتایج: 997532 فیلتر نتایج به سال:
A new boosting algorithm, called FloatBoost, is proposed to overcome the monotonicity problem of the sequential AdaBoost learning. AdaBoost [1, 2] is a sequential forward search procedure using the greedy selection strategy. The premise oÿered by the sequential procedure can be broken-down when the monotonicity assumption, i.e. that when adding a new feature to the current set, the value of the...
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but informative set of structural features, each providing complementary information about the instances. We frame the search for a suitable feature set as a combinatorial optimization problem. For this purpose, we define a...
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that allows an exhaustive model-based search of possible system trajectories in significant fragments of a MAS using forward inference. The idea is to identify tendencies, especially emergent tendencies, by automating the ...
Phrase query evaluation is an important task of every search engine. Optimizing the query evaluation time for phrase queries is the biggest threat for the current search engine. Usually, phrase queries are a hassle for standard indexing techniques. This is generally because, merging the posting lists and checking the word ordering takes a lot of time. This paper proposes a new technique called ...
This paper presents ideas concerning game{tree evaluation that recently improved the author's strong Othello program LOGISTELLO considerably. Two main parts of this program have been reened. In the rst part of this paper, a new evaluation function for Othello is described. While it is table{based like its predecessors , a novel procedure for estimating table entries now allows modeling pattern ...
Grid computing environments include heterogeneous resources shared by a large number of computers to handle the data and process intensive applications. In these environments, the required resources must be accessible for Grid applications on demand, which makes the resource discovery as a critical service. In recent years, various techniques are proposed to index and discover the Grid resource...
This paper presents a new approach for design of the log-periodic dipole array antenna (LPDA) based on using of different design parameters in the LPDA elements to control the antenna behavior. In the proposed procedure, the design parameters can control the value of forward gain over the operating frequency range, and also adjust the gain flatness. Furthermore, this design procedure can decrea...
This paper sets out a method for improving the resolution of resonant microwave sensors. Usually, frequency response these devices is associated with low quality factor, and consequently in terms tracking capacity resonance shift. Furthermore, since only finite number samples can be acquired during measurement process, “true” may not included set data. In order to have an accurate estimate freq...
Recently, real-time planning has been actively studied for solving problems in uncertain and dynamic environments. RTA* is a real-time search algorithm that can provide a computational basis for real-time planning. However, RTA* is not always efficient since obtaining effective heuristic functions is difficult when the problem becomes complicated. In order to keep the problem simple enough for ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید