Sciweavers

4850 search results - page 782 / 970
» Proof and Computation in Geometry
Sort
View
CONSTRAINTS
2011
15 years 1 months ago
Cardinality Networks: a theoretical and empirical study
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [8] in that it ...
Roberto Asín, Robert Nieuwenhuis, Albert Ol...
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
SIAMNUM
2010
129views more  SIAMNUM 2010»
15 years 1 months ago
Convergence of an Adaptive Finite Element Method for Controlling Local Energy Errors
A number of works concerning rigorous convergence theory for adaptive finite element methods (AFEM) for controlling global energy errors have appeared in recent years. However, man...
Alan Demlow
AAAI
2011
14 years 6 months ago
Commitment to Correlated Strategies
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
Vincent Conitzer, Dmytro Korzhyk
SMA
2005
ACM
132views Solid Modeling» more  SMA 2005»
16 years 4 days ago
Simplified engineering analysis via medial mesh reduction
Numerous simplification methods have been proposed for speeding up engineering analysis/ simulation. A recently proposed medial axis reduction is one such method, that is particul...
Murari Sinha, Krishnan Suresh