Sciweavers

3775 search results - page 368 / 755
» The Expression Problem Revisited
Sort
View
STACS
2010
Springer
16 years 1 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
CSL
2009
Springer
16 years 1 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
CEC
2007
IEEE
16 years 1 months ago
A Utile Function Optimizer
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
Christopher K. Monson, Kevin D. Seppi, James L. Ca...
FUZZIEEE
2007
IEEE
16 years 1 months ago
Visualizing Consensus in Group Decision Making Situations
Abstract— In the resolution of group decision making problems the consensus process, that is, the process where experts discuss about the alternatives to narrow their differences...
Sergio Alonso, Enrique Herrera-Viedma, Francisco J...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
16 years 1 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu