Sciweavers

566 search results - page 65 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
99
Voted
CVPR
2005
IEEE
16 years 2 months ago
Tracking Non-Stationary Appearances and Dynamic Feature Selection
Since the appearance changes of the target jeopardize visual measurements and often lead to tracking failure in practice, trackers need to be adaptive to non-stationary appearance...
Ming Yang, Ying Wu
85
Voted
FLAIRS
2003
15 years 1 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
101
Voted
FROCOS
2007
Springer
15 years 6 months ago
Combining Proof-Producing Decision Procedures
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tr...
107
Voted
GECCO
2000
Springer
133views Optimization» more  GECCO 2000»
15 years 4 months ago
Hybrid Differential Evolution for Dynamic Optimization of a Fedbatch Bioreactor Process
A hybrid method of evolutionary algorithms is introduced in this study. The hybrid method includes two additional operations, acceleration and migrating operations. These two oper...
Feng-Sheng Wang
86
Voted
FOCS
1991
IEEE
15 years 4 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein