Sciweavers

783 search results - page 92 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
ALGORITHMICA
2011
13 years 3 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
Sergio Cabello, Bojan Mohar
TCS
2010
13 years 3 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee
ICASSP
2011
IEEE
13 years 14 days ago
RSS-based sensor localization with unknown transmit power
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
Reza M. Vaghefi, Mohammad Reza Gholami, Erik G. St...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 8 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná