5624 search results - page 136 / 1125 » On Conditional Covering Problem |
193
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
169
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
155
click to vote
MOR
2008
15 years 6 months ago
2008
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...
174
click to vote
SIGMETRICS
2005
ACM
15 years 12 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
148
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...