Sciweavers

591 search results - page 40 / 119
» A constraint programming approach to cutset problems
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 27 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
KR
1998
Springer
14 years 21 days ago
Probabilistic Deduction with Conditional Constraints over Basic Events
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
Thomas Lukasiewicz
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
14 years 3 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
APPT
2003
Springer
14 years 1 months ago
Scheduling Outages in Distributed Environments
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
Anthony Butler, Hema Sharda, David Taniar
CP
2007
Springer
14 years 2 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant