Sciweavers

1391 search results - page 84 / 279
» Complexity Limitations on Quantum Computation
Sort
View
193
Voted
ATAL
2010
Springer
15 years 7 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
MICCAI
2005
Springer
16 years 7 months ago
Fast and Simple Calculus on Tensors in the Log-Euclidean Framework
Computations on tensors have become common with the use of DT-MRI. But the classical Euclidean framework has many defects, and affine-invariant Riemannian metrics have been propose...
Vincent Arsigny, Pierre Fillard, Xavier Pennec, Ni...
IPPS
2008
IEEE
16 years 16 days ago
Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Vladimir Surkov
158
Voted
ESAW
2005
Springer
15 years 11 months ago
Collaborative Agent Tuning: Performance Enhancement on Mobile Devices
Ambient intelligence envisages a world saturated with sensors and other embedded computing technologies, operating transparently, and accessible to all in a seamless and intuitive ...
Conor Muldoon, Gregory M. P. O'Hare, Michael J. O'...
148
Voted
BROADNETS
2006
IEEE
16 years 5 days ago
A Secure Programming Paradigm for Network Virtualization
—The central paradigm of today’s successful Internet is to keep the network core simple and move complexity towards the network end points. Unfortunately, this very paradigm li...
Ana Milanova, Sonia Fahmy, David Musser, Büle...