Sciweavers

5624 search results - page 243 / 1125
» On Conditional Covering Problem
Sort
View
188
Voted
ECCC
2010
80views more  ECCC 2010»
15 years 6 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
INFOCOM
2005
IEEE
16 years 6 days ago
Packetostatics: deployment of massively dense sensor networks as an electrostatics problem
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
Stavros Toumpis, Leandros Tassiulas
CF
2010
ACM
15 years 11 months ago
Proposition for a sequential accelerator in future general-purpose manycore processors and the problem of migration-induced cach
As the number of transistors on a chip doubles with every technology generation, the number of on-chip cores also increases rapidly, making possible in a foreseeable future to des...
Pierre Michaud, Yiannakis Sazeides, André S...
CVPR
1997
IEEE
15 years 10 months ago
Learning bilinear models for two-factor problems in vision
In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color...
William T. Freeman, Joshua B. Tenenbaum
EOR
2006
107views more  EOR 2006»
15 years 6 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...