Sciweavers

1242 search results - page 200 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
SWS
2004
ACM
15 years 3 months ago
Applying hierarchical and role-based access control to XML documents
W3C Recommendations XML Encryption and XML-Digital Signature can be used to protect the confidentiality of and provide assurances about the integrity of XML documents transmitted...
Jason Crampton
ATAL
2004
Springer
15 years 3 months ago
Experiments on Deliberation Equilibria in Auctions
Auctions are useful mechanisms for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders know their own valua...
Kate Larson, Tuomas Sandholm
ENC
2003
IEEE
15 years 3 months ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
INFOCOM
2003
IEEE
15 years 3 months ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai