نتایج جستجو برای: search directions

تعداد نتایج: 384783  

2009
Enrico Minack Gianluca Demartini Wolfgang Nejdl

With the growth of the Web and the variety of search engine users, Web search e ectiveness and user satisfaction can be improved by diversi cation. This paper surveys recent approaches to search result diversi cation in both full-text and structured content search. We identify commonalities in the proposed methods describing an overall framework for result diversi cation. We discuss di erent di...

1996
Sergey Fomel

This tutorial describes the classic method of conjugate directions: the generalization of the conjugate-gradient method in iterative least-square inversion. I derive the algebraic equations of the conjugate-direction method from general optimization principles. The derivation explains the “magic” properties of conjugate gradients. It also justifies the use of conjugate directions in cases when ...

2011
Feixiang Chen

We establishes the polynomial convergence of a new class of pathfollowing methods for semidefinite linear complementarity problems, whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carr...

Journal: :PVLDB 2011
Petros Venetis Hector Gonzalez Christian S. Jensen Alon Y. Halevy

Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The emergence of standardized support for location providers in web browsers, as well as of providers of accurate locations, enables so-called hyper-local web querying where the location of a user is accurate at a much finer g...

2002
Steve McIntosh Alfred North Whitehead Pierre Teilhard de Chardin

CONTENTS Introduction The Search for a “Unit of Culture” The Laws of Evolution Applied to the Noosphere Autopoiesis in Noosphere Holons Agreements and Relationships—Noosphere Organisms From Meaning to Value Beauty, Truth, and Goodness—The Primary Values The Directions of Evolution Tripartite Evolution The Perfection Directions Applications of the Theory for Noosphere Evolution Value Nourishment...

2011
Philipp Robbel David Demirdjian Cynthia Breazeal

This paper describes a novel approach for focusing the search for victims of a rescue robot in an unknown environment. Such a rescue operation under time constraints is driven by three opposing factors, namely the need to explore unknown territory, the requirement to maintain robot localization performance as well as map quality in the face of uncertainty, and the need to target the search to a...

Journal: :SIAM Journal on Optimization 1997
Renato D. C. Monteiro

This paper deals with a class of primal-dual interior-point algorithms for semideenite programming (SDP) which was recently introduced by Kojima, Shindoh and Hara 11]. These authors proposed a family of primal-dual search directions that generalizes the one used in algorithms for linear programming based on the scaling matrix X 1=2 S ?1=2. They study three primal-dual algorithms based on this f...

1999
D. Horns

Data taken with the HEGRA Scintillator Array within 2.5 years have been used to search for spatial anisotropies in the arrival directions of cosmic rays (E > 20 TeV). For this purpose partial sky survey maps are produced, carefully taking the detector response and changing conditions in the atmosphere into account. In this paper, results on the search for TeV –emission correlated with the Galac...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

2002
X. ZHAO P. B. LUH W. B. Gong

Bundle methods have been used frequently to solve nonsmooth optimization problems. In these methods, subgradient directions from past iterations are accumulated in a bundle, and a trial direction is obtained by performing quadratic programming based on the information contained in the bundle. A line search is then performed along the trial direction, generating a serious step if the function va...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید