Sciweavers

16596 search results - page 385 / 3320
» Generalized Assignment Problems
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
BCSHCI
2007
15 years 9 months ago
Identifying web usability problems from eye-tracking data
Eye-tracking research is increasingly used to supplement usability tests in both commercial and academic practice. However, while there has been research into links between eyetra...
Claudia Ehmke, Stephanie Wilson
184
Voted
DAM
2008
99views more  DAM 2008»
15 years 7 months ago
Boundary value problems on weighted networks
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
Enrique Bendito, Angeles Carmona, Andrés M....
213
Voted
EOR
2006
79views more  EOR 2006»
15 years 7 months ago
Equilibrium constrained optimization problems
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, ...
323
Voted
DISOPT
2011
240views Education» more  DISOPT 2011»
15 years 2 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...