550 search results - page 10 / 110 » Optimization and Approximation Problems Related to Polynomia... |
ICDIM
2007
IEEE
14 years 1 months ago
2007
IEEE
Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
MP
2010
13 years 6 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...