10608 search results - page 540 / 2122 » Complexity of O'Hara's Algorithm |
178
click to vote
SIGMETRICS
2006
ACM
16 years 1 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
201
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
206
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
181
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
225
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...