Sciweavers

380 search results - page 3 / 76
» Mapping Problems with Finite-Domain Variables into Problems ...
Sort
View
JAL
2002
86views more  JAL 2002»
13 years 5 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
AUTOMATICA
2010
73views more  AUTOMATICA 2010»
13 years 5 months ago
Realization of Boolean control networks
Based on the linear expression of the dynamics of Boolean networks, the coordinate transformation of Boolean variables is defined. It follows that the state space coordinate trans...
Daizhan Cheng, Zhi Qiang Li, Hongsheng Qi
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
11 years 8 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
JUCS
2007
186views more  JUCS 2007»
13 years 5 months ago
An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
Hongbo Liu, Ajith Abraham
CL
2000
Springer
13 years 10 months ago
Modelling Digital Circuits Problems with Set Constraints
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
Francisco Azevedo, Pedro Barahona