6315 search results - page 463 / 1263 » Approximating Solution Structure |
201
click to vote
STOC
2006
ACM
16 years 8 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
187
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
322
click to vote
CP
2011
Springer
14 years 7 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
204
click to vote
STOC
2003
ACM
16 years 8 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
198
Voted
ICTAI
2009
IEEE
16 years 2 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...