1941 search results - page 173 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
223
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
146
click to vote
ATAL
2003
Springer
16 years 8 days ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
186
click to vote
IJNSEC
2010
15 years 1 months ago
2010
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
252
Voted
COMPGEOM
2010
ACM
16 years 4 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
224
click to vote
ICS
2004
Tsinghua U.
16 years 13 days ago
2004
Tsinghua U.
Cache hierarchies have been traditionally designed for usage by a single application, thread or core. As multi-threaded (MT) and multi-core (CMP) platform architectures emerge and...