Sciweavers

3250 search results - page 323 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CAL
2002
15 years 6 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
CVPR
2001
IEEE
16 years 8 months ago
Combining Two-view Constraints For Motion Estimation
In this paper we describe two methods for estimating the motion parameters of an image sequence. For a sequence of images, the global motion can be described by ???? independent m...
Venu Madhav Govindu
DISOPT
2008
89views more  DISOPT 2008»
15 years 6 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 12 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
FOCS
2006
IEEE
16 years 22 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák