5169 search results - page 100 / 1034 » Locality approximation using time |
104
Voted
WMCSA
2009
IEEE
15 years 9 months ago
2009
IEEE
Shair is a system allowing contracted mobile phone users to benefit from their unused quota minutes and text messages. Unused minutes and texts are shared via opportunistic local...
142
Voted
CSC
2009
15 years 3 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
112
click to vote
DISOPT
2010
15 years 2 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
138
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
141
Voted
TKDE
2002
15 years 2 months ago
2002
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...