Sciweavers

714 search results - page 92 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 11 months ago
Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...
EOR
2007
77views more  EOR 2007»
13 years 10 months ago
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
Jorge Maturana, María-Cristina Riff
DSS
2007
113views more  DSS 2007»
13 years 10 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
IGPL
2006
87views more  IGPL 2006»
13 years 10 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
CPAIOR
2006
Springer
13 years 12 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams