Sciweavers

233 search results - page 23 / 47
» Intelligent compilers
Sort
View
CSCLP
2004
Springer
15 years 3 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
AAAI
2012
13 years 1 days ago
Evaluating Temporal Plans in Incomplete Domains
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
Daniel Morwood, Daniel Bryce
CEC
2009
IEEE
15 years 1 months ago
JubiTool: Unified design flow for the Perplexus SIMD hardware accelerator
This paper presents a new unified design flow developed within the Perplexus project that aims to accelerate parallelizable data-intensive applications in the context of ubiquitous...
Olivier Brousse, Jérémie Guillot, Th...
BVAI
2007
Springer
14 years 11 months ago
Logic as Energy: A SAT-Based Approach
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
Priscila Machado Vieira Lima, M. Mariela Morveli-E...
CSCLP
2008
Springer
14 years 11 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin