Sciweavers

1101 search results - page 171 / 221
» Forcing in proof theory
Sort
View
141
Voted
DCG
2008
118views more  DCG 2008»
15 years 19 days ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
JNSM
2008
130views more  JNSM 2008»
15 years 15 days ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
CADE
2004
Springer
16 years 26 days ago
The ICS Decision Procedures for Embedded Deduction
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
Leonardo Mendonça de Moura, Sam Owre, Haral...
109
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 25 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
112
Voted
TPHOL
2007
IEEE
15 years 6 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison