1433 search results - page 252 / 287 » On Covering Problems of Rado |
115
click to vote
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
115
click to vote
EFDBS
2000
15 years 1 months ago
2000
Today, bibliographical information is kept in a variety of data sources world wide, some of them publically available, and some of them also offering information about citations m...
103
click to vote
TAMODIA
2007
15 years 29 days ago
2007
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...
112
click to vote
SPAA
2010
ACM
15 years 8 hour ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
111
click to vote
JSAC
2008
14 years 11 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...