Sciweavers

601 search results - page 33 / 121
» Quantified Equality Constraints
Sort
View
EOR
2008
93views more  EOR 2008»
13 years 10 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
CIE
2008
Springer
13 years 10 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
GLOBECOM
2007
IEEE
14 years 4 months ago
On Signal Processing Methods for MIMO Relay Architectures
— Relay networks have received considerable attention recently, especially when limited size and power resources impose constraints on the number of antennas within a wireless se...
Alireza Shahan Behbahani, Ricardo Merched, Ahmed M...
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 10 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
AAAI
2007
14 years 12 days ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...