Sciweavers

29 search results - page 1 / 6
» Resolution Search and Dynamic Branch-and-Bound
Sort
View
JCO
2002
51views more  JCO 2002»
13 years 4 months ago
Resolution Search and Dynamic Branch-and-Bound
Saïd Hanafi, Fred Glover
IAT
2006
IEEE
13 years 10 months ago
Resolution-Based Policy Search for Imperfect Information Differential Games
Differential games (DGs), considered as a typical model of game with continuous states and non-linear dynamics, play an important role in control and optimization. Finding optimal...
Minh Nguyen-Duc, Brahim Chaib-draa
IPPS
1997
IEEE
13 years 9 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Smaïl Niar, Arnaud Fréville
JSAT
2008
113views more  JSAT 2008»
13 years 4 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
CVPR
2011
IEEE
12 years 8 months ago
Space-Time Super-Resolution from a Single Video
Spatial Super Resolution (SR) aims to recover fine image details, smaller than a pixel size. Temporal SR aims to recover rapid dynamic events that occur faster than the video fra...
Oded Shahar, Alon Faktor, Michal Irani