381 search results - page 25 / 77 » On the advantage over a random assignment |
SAGT
2009
Springer
14 years 3 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
ESORICS
2004
Springer
14 years 2 months ago
2004
Springer
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...
BERTINORO
2005
Springer
14 years 2 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
AAAI
2008
13 years 11 months ago
2008
We propose a new discriminative framework, namely Hidden Dynamic Conditional Random Fields (HDCRFs), for building probabilistic models which can capture both internal and external...