2137 search results - page 320 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
161
click to vote
MDM
2009
Springer
15 years 11 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...
216
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
140
Voted
AUTOMATICA
2005
15 years 4 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
174
click to vote
HICSS
2008
IEEE
15 years 5 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
174
Voted
ICTAI
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...