12783 search results - page 573 / 2557 » Experimenting with computing |
183
click to vote
IPL
2000
15 years 6 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
189
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
131
click to vote
JGO
2010
15 years 5 months ago
2010
In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles wit...
304
click to vote
PC
2011
15 years 2 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
181
click to vote
SIAMSC
2011
15 years 2 months ago
2011
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...