Sciweavers

1920 search results - page 116 / 384
» The Complexity of the A B C Problem
Sort
View
AIPS
2006
15 years 8 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
BIRTHDAY
2010
Springer
15 years 7 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
JUCS
2000
135views more  JUCS 2000»
15 years 6 months ago
The Price of Routing in FPGAs
: Studying the architectural evolution of mainstream field programmable gate arrays (FPGAs) leads to the following remark: in these circuits, the proportion of silicon devoted to r...
Florent de Dinechin
C5
2007
IEEE
16 years 25 days ago
Wild, Wild Wikis: A way forward
Wikis can be considered as public domain knowledge sharing system. They provide opportunity for those who may not have the privilege to publish their thoughts through the traditio...
Robert Charles, Adigun Ranmi
ICDCS
2009
IEEE
16 years 3 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir