Sciweavers

154 search results - page 4 / 31
» Clos Solutions to Binary Methods
Sort
View
ICIP
2008
IEEE
14 years 1 months ago
Dynamic background modeling and subtraction using spatio-temporal local binary patterns
Traditional background modeling and subtraction methods have a strong assumption that the scenes are of static structures with limited perturbation. These methods will perform poo...
Shengping Zhang, Hongxun Yao, Shaohui Liu
AAAI
2007
13 years 9 months 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...
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 11 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
DAGSTUHL
2007
13 years 8 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya