Sciweavers

2294 search results - page 153 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
EDBTW
2006
Springer
15 years 1 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
BROADNETS
2006
IEEE
15 years 4 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
4OR
2010
148views more  4OR 2010»
14 years 8 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ICNP
2005
IEEE
15 years 3 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 11 months ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz