Sciweavers

14548 search results - page 183 / 2910
» The Optimal Path-Matching Problem
Sort
View
EOR
2011
85views more  EOR 2011»
13 years 5 months ago
Optimizing departure times in vehicle routes
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
A. L. Kok, E. W. Hans, J. M. J. Schutten
TMC
2011
203views more  TMC 2011»
13 years 5 months ago
Throughput Optimization in Mobile Backbone Networks
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
CVPR
2012
IEEE
12 years 1 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
TVCG
2012
182views Hardware» more  TVCG 2012»
12 years 1 months ago
ISP: An Optimal Out-of-Core Image-Set Processing Streaming Architecture for Parallel Heterogeneous Systems
—Image population analysis is the class of statistical methods that plays a central role in understanding the development, evolution and disease of a population. However, these t...
Linh K. Ha, Jens Krüger, João Luiz Dih...
OL
2010
104views more  OL 2010»
13 years 9 months ago
On representations of the feasible set in convex optimization
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
Jean B. Lasserre