54 search results - page 5 / 11 » Randomized constraint solvers: a comparative study |
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—The language game approach is widely adopted to study conventionalization of linguistic knowledge. Most of contemporary models concentrate on the dynamics of language games in r...
JSAT
2008
13 years 7 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
CP
2006
Springer
13 years 11 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
TVLSI
2008
13 years 7 months ago
2008
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...