Sciweavers

3082 search results - page 249 / 617
» New Bounds for the Controller Problem
Sort
View
AAAI
2007
15 years 9 months ago
Approximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
Vibhav Gogate, Rina Dechter
TOCL
2008
102views more  TOCL 2008»
15 years 6 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
CP
2007
Springer
15 years 10 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
BC
2010
163views more  BC 2010»
15 years 4 months ago
Action and behavior: a free-energy formulation
We have previously tried to explain perceptual inference and learning under a free-energy principle that pursues Helmholtz's agenda to understand the brain in terms of energy ...
Karl J. Friston, Jean Daunizeau, James Kilner, Ste...
CAAN
2007
Springer
15 years 10 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh