279 search results - page 8 / 56 » Testing for Refinement in CSP |
109
click to vote
ACSD
2006
IEEE
15 years 4 months ago
2006
IEEE
Asynchronous circuits have received much attention recently due to their potential for energy savings. Process algebras have been extensively used in the modelling, analysis and sy...
103
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
105
click to vote
CP
1995
Springer
15 years 4 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
108
click to vote
ENC
2006
IEEE
15 years 4 months ago
2006
IEEE
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...