8009 search results - page 1329 / 1602 » cans 2005 |
202
click to vote
WAOA
2005
Springer
16 years 7 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
207
click to vote
CCS
2005
ACM
16 years 7 days ago
2005
ACM
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
164
click to vote
CIKM
2005
Springer
16 years 7 days ago
2005
Springer
We consider the problem of finding officially unrecognized side effects of drugs. By submitting queries to the Web involving a given drug name, it is possible to retrieve pages co...
179
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
313
click to vote
ICIA
2007
15 years 9 months ago
2007
Mobile recommender systems have the potential to substantially enrich tourist experiences. As their handling marks a big challenge for ordinary users, its acceptance can only be e...