429 search results - page 26 / 86 » Solving the Maximum Clique Problem Using PUBB |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
DAM
2007
13 years 7 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
ISF
2008
13 years 7 months ago
2008
In this study, a mathematical model is suggested concerning the location of VHF/UHF frequency radio jammer systems to the terrain parts to conduct single frequency or sequential fr...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...