4894 search results - page 657 / 979 » The Guarding Problem - Complexity and Approximation |
134
click to vote
SIAMNUM
2011
14 years 11 months ago
2011
The coupled problem with Stokes flow in one subdomain and a Darcy flow model in a second subdomain is studied in this paper. Both flow problems are treated as first-order syste...
155
click to vote
TROB
2011
14 years 11 months ago
2011
—We study the problem of actively searching for an object in a 3D environment under the constraint of a maximum search time, using a visually guided humanoid robot with twentysix...
132
click to vote
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
151
Voted
MASS
2010
14 years 10 months ago
2010
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
171
click to vote
SIAMSC
2011
14 years 10 months ago
2011
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...