2957 search results - page 206 / 592 » The Complexity of Polynomial-Time Approximation |
163
click to vote
CSE
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
171
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
150
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
192
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
190
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...