1363 search results - page 154 / 273 » The road coloring problem |
275
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
216
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
We address issues related to privacy protection in location-based services (LBS). Most existing research in this field either requires a trusted third-party (anonymizer) or uses ...
163
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
162
click to vote
CIKM
2009
Springer
16 years 28 days ago
2009
Springer
Relevance Feedback has proven very effective for improving retrieval accuracy. A difficult yet important problem in all relevance feedback methods is how to optimally balance the...
159
click to vote
SAGT
2009
Springer
16 years 26 days ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...