Sciweavers

264 search results - page 41 / 53
» Numerical Verification of Optimality Conditions
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
VLSID
2006
IEEE
192views VLSI» more  VLSID 2006»
14 years 1 months ago
Beyond RTL: Advanced Digital System Design
This tutorial focuses on advanced techniques to cope with the complexity of designing modern digital chips which are complete systems often containing multiple processors, complex...
Shiv Tasker, Rishiyur S. Nikhil
INFOCOM
2010
IEEE
13 years 6 months ago
Distributed Caching Algorithms for Content Distribution Networks
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
Sem C. Borst, Varun Gupta, Anwar Walid

Presentation
2175views
15 years 8 months ago
Robust Robotic Path Planning Using Level Sets
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surround...
M. Sabry Hassouna
ICCV
2005
IEEE
14 years 9 months ago
Designing Spatially Coherent Minimizing Flows for Variational Problems Based on Active Contours
This paper tackles an important aspect of the variational problems involving active contours, which has been largely overlooked so far: the optimization by gradient flows. Classic...
Guillaume Charpiat, Renaud Keriven, Jean-Philippe ...