Sciweavers

4342 search results - page 616 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
IJCAI
2007
15 years 6 months ago
First Order Decision Diagrams for Relational MDPs
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
Chenggang Wang, Saket Joshi, Roni Khardon
NIPS
2004
15 years 6 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
TSP
2008
123views more  TSP 2008»
15 years 5 months ago
A Rough Programming Approach to Power-Balanced Instruction Scheduling for VLIW Digital Signal Processors
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
Shu Xiao, Edmund Ming-Kit Lai
PR
2010
184views more  PR 2010»
15 years 3 months ago
Total variation, adaptive total variation and nonconvex smoothly clipped absolute deviation penalty for denoising blocky images
The total variation-based image denoising model has been generalized and extended in numerous ways, improving its performance in different contexts. We propose a new penalty func...
Aditya Chopra, Heng Lian
PIMRC
2010
IEEE
15 years 3 months ago
Self-optimizing routing in MANETs with multi-class flows
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Pierre Coucheney, Bruno Gaujal, Corinne Touati