1298 search results - page 110 / 260 » The online set cover problem |
173
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
Trust between a pair of users is an important piece of information for users in an online community (such as electronic commerce websites and product review websites) where users ...
180
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
193
click to vote
IOR
2010
15 years 4 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
151
click to vote
ATAL
2007
Springer
16 years 19 days ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
168
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...