2957 search results - page 133 / 592 » The Complexity of Polynomial-Time Approximation |
138
Voted
IPCO
1998
15 years 6 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
154
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
132
Voted
JAIR
1998
15 years 4 months ago
1998
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
149
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
139
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...