11345 search results - page 1821 / 2269 » Foundations of Computer Science |
128
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
153
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
145
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
143
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
157
click to vote
ACMSE
2004
ACM
15 years 10 months ago
2004
ACM
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....