Sciweavers

10568 search results - page 1634 / 2114
» Computer Intelligence and Formalization
Sort
View
C3S2E
2010
ACM
15 years 8 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
FSTTCS
2008
Springer
15 years 8 months ago
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
Juan Rodríguez-Hortalá
GISCIENCE
2010
Springer
215views GIS» more  GISCIENCE 2010»
15 years 7 months ago
Microtheories for Spatial Data Infrastructures - Accounting for Diversity of Local Conceptualizations at a Global Level
The categorization of our environment into feature types is an essential prerequisite for cartography, geographic information retrieval, routing applications, spatial decision supp...
Stephanie Duce, Krzysztof Janowicz
AMC
2007
125views more  AMC 2007»
15 years 7 months ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase
173
Voted
AROBOTS
2010
101views more  AROBOTS 2010»
15 years 7 months ago
A quantitative assessment of structural errors in grid maps
Various common error sources affect the quality of a map, e.g., salt and pepper noise and other forms of noise that are more or less uniformly distributed over the map. But there ...
Andreas Birk
« Prev « First page 1634 / 2114 Last » Next »