2796 search results - page 210 / 560 » The coolest path problem |
178
click to vote
XSYM
2005
Springer
16 years 1 days ago
2005
Springer
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using se...
174
click to vote
PODC
2004
ACM
16 years 15 min ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
153
click to vote
SIGMETRICS
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
195
click to vote
WIDM
2004
ACM
15 years 12 months ago
2004
ACM
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
164
click to vote
ACSAC
2003
IEEE
15 years 12 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...