Sciweavers

2109 search results - page 206 / 422
» Solving Necklace Constraint Problems
Sort
View
SAC
2010
ACM
16 years 1 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
Young Joon Ahn, Christoph M. Hoffmann
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 11 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
HYBRID
2004
Springer
15 years 12 months ago
On the Optimal Control of Switch-Mode DC-DC Converters
This paper presents a new solution approach to the optimal control problem of fixed frequency switch-mode DC-DC converters using hybrid systems methodologies. In particular, the n...
Tobias Geyer, Georgios Papafotiou, Manfred Morari
JFPLC
2001
15 years 7 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...
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...