Sciweavers

151 search results - page 11 / 31
» Online Square Packing
Sort
View
CORR
2008
Springer
69views Education» more  CORR 2008»
14 years 9 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu
TCS
2010
14 years 8 months ago
Class constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
89
Voted
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
14 years 9 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
MFCS
2005
Springer
15 years 3 months ago
Online and Dynamic Recognition of Squarefree Strings
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
Jesper Jansson, Zeshan Peng
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 4 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu