9842 search results - page 1842 / 1969 » The Complexity of the Matching-Cut Problem |
SIGECOM
2003
ACM
14 years 3 months ago
2003
ACM
A market-based scheduling mechanism allocates resources indexed by time to alternative uses based on the bids of participating agents. Agents are typically interested in multiple ...
SMA
2003
ACM
14 years 3 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
ATAL
2003
Springer
14 years 3 months ago
2003
Springer
System performance in multi-agent resource allocation systems can often improve if individual agents reduce their activity. Agents in such systems need a way to modulate their ind...
ATAL
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...