536 search results - page 44 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
SIAMNUM
2010
13 years 3 months ago
2010
We derive a posteriori error estimates for the discretization of the heat equation in a unified and fully discrete setting comprising the discontinuous Galerkin, finite volume, mix...
ANSS
1991
IEEE
14 years 1 days ago
1991
IEEE
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
FOCM
2010
13 years 7 months ago
2010
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
WSCG
2004
13 years 10 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
TEC
2002
13 years 8 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...