Sciweavers

575 search results - page 76 / 115
» Constraint Functional Multicore Programming
Sort
View
EMNLP
2008
13 years 9 months ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
JFPLC
2001
13 years 9 months ago
Recherche adaptative et contraintes musicales
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...
Charlotte Truchet, Carlos Agon, Gérard Assa...
ICCD
2003
IEEE
98views Hardware» more  ICCD 2003»
14 years 4 months ago
Specifying and Verifying Systems with Multiple Clocks
Multiple clock domains are a challenge for hardware specification and verification. We present a method for specifying the relations between multiple clocks, and for modeling th...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
ICSE
2009
IEEE-ACM
14 years 2 months ago
Semantics-based code search
Our goal is to use the vast repositories of available open source code to generate specific functions or classes that meet a user’s specifications. The key words here are spec...
Steven P. Reiss
TCS
2008
13 years 7 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi