نتایج جستجو برای: forward search procedure
تعداد نتایج: 997532 فیلتر نتایج به سال:
A number of current planners make use of automatic domain analysis techniques to extract information such as state invariants or necessary goal orderings from a planning domain. There are also planners that allow the user to explicitly specify additional information intended to improve performance. One such planner is TALplanner, which allows the use of domain-dependent temporal control formula...
In an earlier paper the author defined N1L configurations, and stated a conjecture concerning them which would lead to an improvement by a constant factor to the sphere-packing bound for linear double error correcting codes. Here a computer search is presented, in an effort to gather evidence on the conjecture.
Online video viewing has seen explosive growth, yet simple tools to facilitate navigation and sharing of the large video space have not kept pace. We propose the use of single-video viewing statistics as the basis for a visualization of video called the View Count Record (VCR). Our novel visualization utilizes variable-sized thumbnails to represent the popularity (or affectiveness) of video int...
In this paper we introduce a new class of search problem which we calìalternating search'. Two searchers starting at given points in diierent search regions, who can move alternately with speed one, or (as a limiting case) simultaneously with combined speed one, seek to nd (reach) an object in least expected time. The hidden object is stationary and its location is given by a known distribution...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید