Sciweavers

252 search results - page 27 / 51
» Decremental Clique Problem
Sort
View
ICML
2009
IEEE
15 years 10 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
LCPC
2009
Springer
15 years 2 months ago
A Balanced Approach to Application Performance Tuning
Abstract. Current hardware trends place increasing pressure on programmers and tools to optimize scientific code. Numerous tools and techniques exist, but no single tool is a pana...
Souad Koliai, Stéphane Zuckerman, Emmanuel ...
HIPC
2000
Springer
15 years 1 months ago
Improving Offset Assignment on Embedded Processors Using Transformations
Embedded systems consisting of the application program ROM, RAM, the embedded processor core and any custom hardware on a single wafer are becoming increasingly common in areas suc...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
AUTONOMICS
2007
ACM
14 years 11 months ago
Multi-hop broadcast from theory to reality: practical design for ad hoc networks
We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networ...
Alaeddine El Fawal, Jean-Yves Le Boudec, Kav&eacut...
86
Voted
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
15 years 1 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo