Sciweavers

2527 search results - page 217 / 506
» Discrete optimization in computer vision
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 8 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 8 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
COR
2006
112views more  COR 2006»
15 years 4 months ago
A continuous approach to considering uncertainty in facility design
This paper presents a formulation of the facilities block layout problem which explicitly considers uncertainty in material handling costs on a continuous scale by use of expected...
Bryan A. Norman, Alice E. Smith
TOG
2008
137views more  TOG 2008»
15 years 4 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
SIGPRO
2010
73views more  SIGPRO 2010»
15 years 2 months ago
Continuous-time and continuous-discrete-time unscented Rauch-Tung-Striebel smoothers
This article considers the application of the unscented transformation to approximate fixed-interval optimal smoothing of continuous-time non-linear stochastic systems. The propo...
Simo Särkkä