Sciweavers

1963 search results - page 359 / 393
» The Maximum Solution Problem on Graphs
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
IPSN
2011
Springer
13 years 1 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
LION
2007
Springer
192views Optimization» more  LION 2007»
14 years 4 months ago
Learning While Optimizing an Unknown Fitness Surface
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
Roberto Battiti, Mauro Brunato, Paolo Campigotto
WOWMOM
2005
ACM
184views Multimedia» more  WOWMOM 2005»
14 years 3 months ago
ALCA: A New Scheme for Power Control on 802.11 Ad Hoc Networks
— This paper presents the ALCA (Asymmetric Link Collision Avoidance) protocol. ALCA was designed to deal with a known deficiency of the Basic Scheme [1] for power control in 802...
Alexandre Andrade Pires, José Ferreira de R...
ICCAD
1997
IEEE
69views Hardware» more  ICCAD 1997»
14 years 2 months ago
Speeding up technology-independent timing optimization by network partitioning
Technology-independenttimingoptimizationis animportantproblem in logic synthesis. Although many promising techniques have been proposed in the past, unfortunately they are quite s...
Rajat Aggarwal, Rajeev Murgai, Masahiro Fujita