536 search results - page 57 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
185
click to vote
EMSOFT
2004
Springer
15 years 11 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
135
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
192
click to vote
FOCM
2008
15 years 6 months ago
2008
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
151
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
164
click to vote
HYBRID
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...