569 search results - page 9 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
GECCO
2006
Springer
14 years 8 days ago
2006
Springer
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
IEAAIE
2001
Springer
14 years 1 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
SAT
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...