Sciweavers

1816 search results - page 261 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Variational Bayesian Kalman filtering in dynamical tomography
The problem of dynamical tomography consists in reconstructing a temporal sequence of images from their noisy projections. For this purpose, a recursive algorithm is usually used,...
Boujemaa Ait-El-Fquih, Thomas Rodet
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
16 years 16 hour ago
A multi-objective genetic algorithm for robust design optimization
Real-world multi-objective engineering design optimization problems often have parameters with uncontrollable variations. The aim of solving such problems is to obtain solutions t...
Mian Li, Shapour Azarm, Vikrant Aute
JMLR
2006
96views more  JMLR 2006»
15 years 6 months ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 6 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
AI
2010
Springer
15 years 6 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina