Filtrar la búsqueda

  • Libros (9)

a

Intervalo de precios personalizado (EUR)

a

Ye xugang (9 resultados)

  • Idioma: Inglés

    Editorial: Editorial Academica Espanola, 2011

    384653174X / 9783846531747

    • Tapa blanda

    Librería: Books Puddle, Woodside, NY, Estados Unidos de AmericaBooks Puddle

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 99,43

    Envío por EUR 3,63 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Condición: New. pp. 136.

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Tapa blanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 51,35

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Random Disambiguation Paths: Models, Algorithms, and Analysis | Exploring the methodologies for traversing mapped uncertain terrain under optimized navigation/disambiguation protocols | Xugang Ye | Taschenbuch | 136 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846531747 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Tapa blanda

    Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 164,55

    Envío por EUR 30,03 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing Dez 2011, 2011

    384653174X / 9783846531747

    • Tapa blanda
    • Impresión bajo demanda

    Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 59,00

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called CR , in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it s a realizable stratergy. 136 pp. Englisch.…

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Tapa blanda
    • Impresión bajo demanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 59,00

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called CR , in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it s a realizable stratergy.…

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Tapa blanda
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 48,50

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ye XugangXugang Ye is a research fellow at the Natinal Institutes of Health. Hereceived his Ph.D. in Applied Mathematics and Statistics from the Johns Hopkins University in Dec. 2008. His research intersts include operations research.…

  • Idioma: Inglés

    Editorial: Editorial Academica Espanola, 2011

    384653174X / 9783846531747

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 101,32

    Envío por EUR 7,81 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Condición: New. Print on Demand pp. 136 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

  • Idioma: Inglés

    Editorial: Editorial Academica Espanola, 2011

    384653174X / 9783846531747

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 100,70

    Envío por EUR 9,95 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Condición: New. PRINT ON DEMAND pp. 136.

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing Dez 2011, 2011

    384653174X / 9783846531747

    • Tapa blanda
    • Impresión bajo demanda

    Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 59,00

    Envío por EUR 60,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called 'CR', in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A\* algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it's a realizable stratergy.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 136 pp. Englisch.…