Revistas
Artículos
Publicaciones
Documentos
REVISTA
IEEE TRANSACTIONS ON INFORMATION THEORY
TODAS
Inicio
/
IEEE TRANSACTIONS ON INFORMATION THEORY
/
Vol: 45 Núm: 6 Par: 0 (1999)
/
Artículo
ARTÍCULO
TITULO
The Shortest Common Superstring Problem: Average Case Analysis for Both Exact and Approximate Matching
Yang
E-h
Zhang
Z
Resumen
No disponible
PÁGINAS
pp. 1867 - 1886
NÚMERO
Volumen: 45 Número: 6 Parte: 0 (1999)
MATERIAS
INGENIERÍA Y CONSTRUCCIÓN CIVIL
REVISTAS SIMILARES
Aerospace
Algorithms
Applied Sciences
Artículos similares
Adapting the A* algorithm for park spot routing
Acceso
Mareike Hedderich, Ulrich Fastenrath, Gordon Isaac, Klaus Bogenberger
Pág. 1066 - 1073
Major cities encounter traffic problems every day, whereby the studies of IBM (2011) showed that drivers looking for a parking spot have a large impact on urban traffic. This paper presents an approach for a park spot route (PSR) in a city using on-stree...
ver más
Revista:
Transportation Research Procedia
School travel route measurement and built environment effects in models of children?s school travel behavior
Acceso
Kristian Larsen, Ron N Buliung, Guy EJ Faulkner
The most common form of physical activity for people of all ages is walking, thus the use of active travel modes, such as walking or cycling for school trips, can increase daily physical activity levels. School travel is one way to encourage walking and ...
ver más
Revista:
Journal of Transport and Land Use
Revistas destacadas
Infrastructures
Informed Infraestructure
BiT
Revista de la Construcción
Ver todas las revistas