Sciweavers

151 search results - page 20 / 31
» Experimental Evaluation of Preprocessing Techniques in Const...
Sort
View
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
12 years 10 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
JSAT
2006
134views more  JSAT 2006»
13 years 8 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
PARELEC
2002
IEEE
14 years 26 days ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
DATE
2000
IEEE
88views Hardware» more  DATE 2000»
14 years 11 days ago
Free MDD-Based Software Optimization Techniques for Embedded Systems
Embedded systems make a heavy use of software to perform Real-Time embedded control tasks. Embedded software is characterized by a relatively long lifetime and by tight cost, perf...
Chunghee Kim, Luciano Lavagno, Alberto L. Sangiova...
AI
2010
Springer
13 years 8 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...