36 search results - page 5 / 8 » Symbolic Preconditioning with Taylor Models: Some Examples |
ICONIP
2007
13 years 9 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
ICRA
1993
IEEE
13 years 11 months ago
1993
IEEE
An issue central to the navigation problem is memory. Traditional systems build symbolic maps of the world for navigational reference. Reactive methods, in contrast, eliminate or m...
DIAGRAMS
2004
Springer
13 years 11 months ago
2004
Springer
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They were designed to complement the Unified Modeling Language in the development ...
SPAA
2004
ACM
14 years 28 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...