1941 search results - page 174 / 389 » On the Hardness of Approximate Reasoning |
206
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
176
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
188
click to vote
AIRWEB
2008
Springer
15 years 8 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
157
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
189
click to vote
SPAA
2010
ACM
15 years 6 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...