270 search results - page 5 / 54 » Exploiting Problem Structure for Solution Counting |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
LSSC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we discuss an inclusion method for solving rectangular (over- and under-determined) dense linear systems where the input data are uncertain and vary within ...
4OR
2006
13 years 7 months ago
2006
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
AIPS
2007
13 years 10 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...