Sciweavers

397 search results - page 53 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
MST
2010
117views more  MST 2010»
13 years 8 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
ICDCS
2012
IEEE
12 years 23 days ago
Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
Wei Wang, Baochun Li, Ben Liang
BCB
2010
150views Bioinformatics» more  BCB 2010»
13 years 5 months ago
Enzymatic target identification with dynamic states
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
Bin Song, Sanjay Ranka, Tamer Kahveci
CIMCA
2008
IEEE
14 years 4 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
IPPS
2006
IEEE
14 years 4 months ago
QoS-based management of multiple shared resource in dynamic real-time systems
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
Klaus H. Ecker, Frank Drews, Jens Lichtenberg