Sciweavers

1984 search results - page 193 / 397
» The colourful feasibility problem
Sort
View
SERA
2005
Springer
16 years 19 days ago
A Comparative Evaluation of Query Modeling Cost of SQL/MDR
This paper shows the feasibility of SQL/MDR development. Previous approach has several problems such as complicated exchanging mechanism, dependent description to local MDR system...
Dongwon Jeong, Hoh Peter In, Lee-Sub Lee
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
16 years 19 days ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
16 years 18 days ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
COMPGEOM
2004
ACM
16 years 17 days ago
Pushing squares around
We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are...
Adrian Dumitrescu, János Pach
FMCAD
2004
Springer
16 years 16 days ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl