Sciweavers

952 search results - page 63 / 191
» Computational complexity of stochastic programming problems
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 21 days ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
POPL
2008
ACM
16 years 26 days ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
111
Voted
AIR
2004
111views more  AIR 2004»
15 years 13 days ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
CACM
2007
164views more  CACM 2007»
15 years 17 days ago
Is abstraction the key to computing?
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
Jeff Kramer
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 6 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg