Sciweavers

4117 search results - page 292 / 824
» On the Satisfiability of Complex Constraints
Sort
View
BMCBI
2010
115views more  BMCBI 2010»
15 years 7 months ago
Multiconstrained gene clustering based on generalized projections
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
Jia Zeng, Shanfeng Zhu, Alan Wee-Chung Liew, Hong ...
JSAT
2006
134views more  JSAT 2006»
15 years 6 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
CP
2007
Springer
16 years 29 days ago
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
DEON
2006
Springer
15 years 8 months ago
A Logical Architecture of a Normative System
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
Guido Boella, Leendert W. N. van der Torre
MP
2008
117views more  MP 2008»
15 years 6 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph