Sciweavers

79 search results - page 6 / 16
» A Dynamic Programming Framework for Combinatorial Optimizati...
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 1 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
CPAIOR
2010
Springer
14 years 17 days ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
IPPS
1999
IEEE
14 years 1 days ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
CASES
2007
ACM
13 years 11 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra
MOBIHOC
2009
ACM
14 years 8 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar