Sciweavers

1589 search results - page 60 / 318
» Constraints with Variables' Annotations
Sort
View
PTS
2010
175views Hardware» more  PTS 2010»
13 years 6 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
SAC
2009
ACM
14 years 3 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
CSCLP
2003
Springer
14 years 1 months ago
A Comparative Study of Arithmetic Constraints on Integer Intervals
Abstract. We propose here a number of approaches to implement constraint propagation for arithmetic constraints on integer intervals. To this end we introduce integer interval arit...
Krzysztof R. Apt, Peter Zoeteweij
IPL
2000
96views more  IPL 2000»
13 years 8 months ago
On bounded occurrence constraint satisfaction
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Johan Håstad
ATAL
2009
Springer
14 years 3 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee