Sciweavers

363 search results - page 30 / 73
» The SAT Phase Transition
Sort
View
CONCUR
1991
Springer
14 years 3 hour ago
A Tool Set for deciding Behavioral Equivalences
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
Jean-Claude Fernandez, Laurent Mounier
AAAI
1997
13 years 9 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
CLIMA
2010
13 years 8 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 8 months ago
Predicting the Impact of Measures Against P2P Networks on the Transient Behaviors
The paper has two objectives. The first is to study rigorously the transient behavior of some P2P networks where information is replicated and disseminated according to an epidemic...
Eitan Altman, Philippe Nain, Adam Shwartz, Yuedong...
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
14 years 2 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...