Sciweavers

8828 search results - page 310 / 1766
» Formal methods in practice
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
UAI
2000
15 years 8 months ago
Feature Selection and Dualities in Maximum Entropy Discrimination
Incorporating feature selection into a classi cation or regression method often carries a number of advantages. In this paper we formalize feature selection speci cally from a dis...
Tony Jebara, Tommi Jaakkola
NFM
2011
306views Formal Methods» more  NFM 2011»
15 years 1 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
JCS
2010
80views more  JCS 2010»
15 years 1 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
CHI
2009
ACM
16 years 7 months ago
DIY for CHI: methods, communities, and values of reuse and customization
People tinker, hack, fix, reuse, and assemble materials in creative and unexpected ways, often codifying and sharing their production process with others. Do-ityourself (DIY) enco...
Leah Buechley, Daniela Karin Rosner, Eric Paulos, ...