Sciweavers

12519 search results - page 181 / 2504
» Approximation Problems Categories
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
ATAL
2010
Springer
15 years 7 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ATAL
2010
Springer
15 years 7 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
CVPR
1999
IEEE
16 years 8 months ago
Factorization as a Rank 1 Problem
Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD ...
Pedro M. Q. Aguiar, José M. F. Moura
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
On the survey-propagation equations for the random K-satisfiability problem
In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
Giorgio Parisi