Sciweavers

4266 search results - page 552 / 854
» The container loading problem
Sort
View
CVPR
2011
IEEE
14 years 8 months ago
A Two-Stage Reconstruction Approach for Seeing Through Water
Several attempts have been lately proposed to tackle the problem of recovering the original image of an underwater scene using a sequence distorted by water waves. The main draw...
Omar Oreifej, Guang Shu, Teresa Pace, and Mubarak ...
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
14 years 6 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 6 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
DMGT
2011
94views more  DMGT 2011»
14 years 6 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
154
Voted
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 6 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe