Sciweavers

19320 search results - page 156 / 3864
» On the complexity of computing determinants
Sort
View
VLSID
2005
IEEE
121views VLSI» more  VLSID 2005»
16 years 5 months ago
A Heuristic for Peak Power Constrained Design of Network-on-Chip (NoC) Based Multimode Systems
Designing NoC-based systems has become increasingly complex with support for multiple functionalities. Decisions regarding interconnections between the heterogeneous system compon...
Praveen Bhojwani, Rabi N. Mahapatra, Eun Jung Kim,...
145
Voted
COLT
2004
Springer
15 years 8 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner
C3S2E
2008
ACM
15 years 7 months ago
Integer least squares: sphere decoding and the LLL algorithm
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss...
Sanzheng Qiao
137
Voted
JDA
2008
85views more  JDA 2008»
15 years 5 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
CCGRID
2010
IEEE
14 years 8 months ago
WORKEM: Representing and Emulating Distributed Scientific Workflow Execution State
- Scientific workflows have become an integral part of cyberinfrastructure as their computational complexity and data sizes have grown. However, the complexity of the distributed i...
Lavanya Ramakrishnan, Dennis Gannon, Beth Plale