Sciweavers

7167 search results - page 538 / 1434
» Answer Set Programming
Sort
View
CL
2000
Springer
15 years 9 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
ISPASS
2007
IEEE
15 years 11 months ago
Cross Binary Simulation Points
Architectures are usually compared by running the same workload on each architecture and comparing performance. When a single compiled binary of a program is executed on many diff...
Erez Perelman, Jeremy Lau, Harish Patil, Aamer Jal...
KBSE
2003
IEEE
15 years 10 months ago
Specification and Synthesis of Hybrid Automata for Physics-Based Animation
Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete varia...
Thomas Ellman
CPHYSICS
2008
123views more  CPHYSICS 2008»
15 years 4 months ago
wannier90: A tool for obtaining maximally-localised Wannier functions
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
Arash A. Mostofi, Jonathan R. Yates, Young-Su Lee,...
ICALP
2010
Springer
15 years 9 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen