696 search results - page 58 / 140 » A class of combinatorial identities |
154
click to vote
SIAMDM
2002
15 years 5 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
171
click to vote
JCSS
2006
15 years 6 months ago
2006
In an open networking environment, a workstation usually needs to identify its legal users for providing its services. Kerberos provides an efficient approach whereby a trusted th...
142
click to vote
PET
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. In mobile wireless networks, third parties can track the location of mobile nodes by monitoring the pseudonyms used for identification. A frequently proposed solution to...
145
click to vote
HM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
189
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...