Sciweavers

140 search results - page 19 / 28
» Some new results for optimal ternary linear codes
Sort
View
SAGA
2001
Springer
13 years 11 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 5 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
SAIG
2000
Springer
13 years 11 months ago
Compiling Embedded Languages
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
Conal Elliott, Sigbjorn Finne, Oege de Moor
DYNAMO
2000
110views more  DYNAMO 2000»
13 years 8 months ago
Machine-adaptable dynamic binary translation
Dynamic binary translation is the process of translating and optimizing executable code for one machine to another at runtime, while the program is "executing" on the ta...
David Ung, Cristina Cifuentes
SCCC
2000
IEEE
13 years 11 months ago
A Genetic Classifier Tool
Knowledge discovery is the most desirable end product of an enterprise information system. Researches from different areas recognize that a new generation of intelligent tools for...
Aurora T. R. Pozo, Mozart Hasse