102 search results - page 7 / 21 » Distributed Approximation Algorithms for Weighted Problems i... |
GECCO
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
AAAI
1997
13 years 8 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
MDM
2009
Springer
14 years 2 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
TSP
2008
13 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...