Sciweavers

1242 search results - page 87 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 7 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
14 years 10 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
SAC
2012
ACM
13 years 5 months ago
On a hybrid data cloning method and its application in generalized linear mixed models
Data cloning method is a new computational tool for computing maximum likelihood estimates in complex statistical models such as mixed models. This method is synthesized with inte...
Hossein Baghishani, Håvard Rue, Mohsen Moham...
TLCA
2005
Springer
15 years 3 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger