Sciweavers

1024 search results - page 90 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
EOR
2008
86views more  EOR 2008»
14 years 10 months ago
Batch scheduling of deteriorating reworkables
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. E...
M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kova...
CORR
2007
Springer
146views Education» more  CORR 2007»
14 years 10 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
EC
2007
145views ECommerce» more  EC 2007»
14 years 10 months ago
Covariant Genetic Dynamics
We present a covariant form for the dynamics of a canonical GA of arbitrary cardinality, showing how each genetic operator can be uniquely represented by a mathematical object - a...
Chryssomalis Chryssomalakos, Christopher R. Stephe...
EOR
2007
89views more  EOR 2007»
14 years 10 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...
GC
2007
Springer
14 years 9 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...