Sciweavers

5180 search results - page 835 / 1036
» Concurrency, Time, and Constraints
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Joint Power and Secret Key Queue Management for Delay Limited Secure Communication
—In recent years, the famous wiretap channel has been revisited by many researchers and information theoretic secrecy has become an active area of research in this setting. In th...
Onur Güngör 0002, Jian Tan, Can Emre Kok...
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
14 years 9 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
MMB
2012
Springer
259views Communications» more  MMB 2012»
14 years 2 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...