Sciweavers

5214 search results - page 102 / 1043
» The Online Specialization Problem
Sort
View
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 10 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
DAM
2006
116views more  DAM 2006»
13 years 9 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
JSAT
2006
114views more  JSAT 2006»
13 years 9 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
EOR
2002
105views more  EOR 2002»
13 years 8 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
ICASSP
2009
IEEE
14 years 3 months ago
Data-driven online variational filtering in wireless sensor networks
In this paper, a data-driven extension of the variational algorithm is proposed. Based on a few selected sensors, target tracking is performed distributively without any informati...
Hichem Snoussi, Jean-Yves Tourneret, Petar M. Djur...