1380 search results - page 93 / 276 » A General Polynomial Sieve |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
SIAMCO
2008
13 years 10 months ago
2008
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
ANOR
2002
13 years 9 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, an...