Online searching with turn cost (Q2503358): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q532680
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Shmuel Gal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995434882 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0406045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet more on the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online searching with an autonomous robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general search game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Solutions for Linear Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of the Exponential Functions for Some Minimax Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2746971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel searching on \(m\) rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find a point on a line within a fixed distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star search -- a different show / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Position-independent near optimal searching and on-line recognition in star polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ultimate strategy to search on \(m\) rays? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in on-line geometric searching / rank
 
Normal rank

Latest revision as of 20:24, 24 June 2024

scientific article
Language Label Description Also known as
English
Online searching with turn cost
scientific article

    Statements

    Online searching with turn cost (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    online problems
    0 references
    search games
    0 references
    linear-search problem
    0 references
    star search
    0 references
    cow-path problem
    0 references
    turn cost
    0 references
    competitive ratio
    0 references
    infinite linear programs
    0 references
    randomized strategies
    0 references
    0 references
    0 references