Sciweavers

3019 search results - page 287 / 604
» Approximating the Domatic Number
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 6 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 6 months ago
Algorithmic Pricing via Virtual Valuations
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg
JCSS
2008
138views more  JCSS 2008»
15 years 6 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
JSAC
2006
107views more  JSAC 2006»
15 years 6 months ago
Adaptive Sensor Activity Control in Many-to-One Sensor Networks
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
Zhifeng Hu, Junshan Zhang, Lang Tong
JOIN
2007
91views more  JOIN 2007»
15 years 6 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest