Sciweavers

143 search results - page 20 / 29
» Timed CSP: A Retrospective
Sort
View
BMCBI
2007
157views more  BMCBI 2007»
14 years 10 months ago
A hybrid multiscale Monte Carlo algorithm (HyMSMC) to cope with disparity in time scales and species populations in intracellula
Background: The fundamental role that intrinsic stochasticity plays in cellular functions has been shown via numerous computational and experimental studies. In the face of such e...
Asawari Samant, Babatunde A. Ogunnaike, Dionisios ...
IRI
2006
IEEE
15 years 4 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
CP
2001
Springer
15 years 2 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
CP
1999
Springer
15 years 2 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
ECAI
2008
Springer
14 years 12 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...