4894 search results - page 33 / 979 » The Guarding Problem - Complexity and Approximation |
100
Voted
WSC
2004
15 years 3 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
131
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
110
click to vote
ESA
2010
Springer
15 years 3 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
124
Voted
JCSS
2010
15 years 1 months ago
2010
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
CMA
2010
14 years 12 months ago
2010
In this paper, the homotopy analysis method (HAM) is applied to solve a parameterized sixth order boundary value problem which, for large parameter values, cannot be solved by oth...