10608 search results - page 389 / 2122 » Complexity of O'Hara's Algorithm |
156
click to vote
ICAI
2004
15 years 5 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
145
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
122
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
151
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
174
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...