5624 search results - page 566 / 1125 » On Conditional Covering Problem |
208
click to vote
TAMODIA
2007
15 years 8 months 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 ...
222
click to vote
SPAA
2010
ACM
15 years 7 months 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...
231
click to vote
JSAC
2008
15 years 7 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...
211
click to vote
JETAI
2007
15 years 7 months ago
2007
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
198
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
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...