Sciweavers

2864 search results - page 386 / 573
» Constraint Programming in OPL
Sort
View
EMNLP
2008
13 years 10 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
VAMOS
2008
Springer
13 years 10 months ago
Model-Based Implementation of Meta-Variability Constructs: A Case Study using Aspects
In this paper, we introduce the concept of metavariability, i.e., variability with respect to basic variability attributes like binding time or constraints. While the main focus o...
Klaus Schmid, Holger Eichelberger
IJCAI
2001
13 years 10 months ago
Robot Weightlifting By Direct Policy Search
This paper describes a method for structuring a robot motor learning task. By designing a suitably parameterized policy, we show that a simple search algorithm, along with biologi...
Michael T. Rosenstein, Andrew G. Barto
JFPLC
2001
13 years 10 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...
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
13 years 10 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...