2168 search results - page 276 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
172
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
132
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
151
click to vote
ICWS
2009
IEEE
16 years 1 months ago
2009
IEEE
Professional mashups that include complex choreographies, data mediation, and result publishing within Web pages are still affected by implementation and design practices that rel...
122
click to vote
OSDI
1996
ACM
15 years 5 months ago
1996
ACM
The need for supportingvarietyof hard and soft real-time, as well as best effort applications ina multimedia computing environment requires an operating system framework that: (1)...
159
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...