Sciweavers

14548 search results - page 79 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICEIS
2010
IEEE
13 years 8 months ago
Pattern Recognition as a Human Centered non-Euclidean Problem
Regularities in the world are human defined. Patterns in the observed phenomena are there because we define and recognize them as such. Automatic pattern recognition tries to bridg...
Robert P. W. Duin
SIAMNUM
2010
89views more  SIAMNUM 2010»
13 years 4 months ago
Convergence of a Fully Conservative Volume Corrected Characteristic Method for Transport Problems
We consider the convergence of a volume corrected characteristics-mixed method (VCCMM) for advection-diffusion systems. It is known that, without volume correction, the method is f...
Todd Arbogast, Wen-Hao Wang
JCO
2011
63views more  JCO 2011»
13 years 28 days ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
TEC
2012
234views Formal Methods» more  TEC 2012»
12 years 13 days ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao
JAR
2011
112views more  JAR 2011»
13 years 5 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...