Sciweavers

3974 search results - page 267 / 795
» Metric Functional Dependencies
Sort
View
179
Voted
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 9 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
173
Voted
COCOON
2008
Springer
15 years 8 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
179
Voted
NIPS
2004
15 years 7 months ago
Experts in a Markov Decision Process
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
Eyal Even-Dar, Sham M. Kakade, Yishay Mansour
IJCAI
1993
15 years 7 months ago
The Statistical Learning of Accurate Heuristics
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
Anna Bramanti-Gregor, Henry W. Davis
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 6 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro