Sciweavers

187 search results - page 7 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
88
Voted
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 1 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
TIP
2010
163views more  TIP 2010»
14 years 4 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
80
Voted
RAS
2000
119views more  RAS 2000»
14 years 9 months ago
Benchmarking cerebellar control
Cerebellar models have long been advocated as viable models for robot dynamics control. Building on an increasing insight in and knowledge of the biological cerebellum, many model...
P. Patrick van der Smagt
80
Voted
CEC
2009
IEEE
15 years 4 months ago
The Differential Ant-Stigmergy Algorithm applied to dynamic optimization problems
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
Peter Korosec, Jurij Silc
CCE
2008
14 years 9 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny