14165 search results - page 483 / 2833 » The generalized two-server problem |
185
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
163
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
176
click to vote
MCS
2009
Springer
16 years 1 months ago
2009
Springer
An ensemble is generated by training multiple component learners for a same task and then combining them for predictions. It is known that when lots of trained learners are availab...
167
click to vote
RECSYS
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
176
click to vote
HPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Grid applications have been prone to encountering problems such as failures or malicious attacks during execution, due to their distributed and large-scale features. The applicati...