Sciweavers

10792 search results - page 296 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
CSL
2008
Springer
15 years 8 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
TPDS
1998
110views more  TPDS 1998»
15 years 6 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 4 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
CORR
2010
Springer
192views Education» more  CORR 2010»
15 years 4 months ago
Constructing elliptic curve isogenies in quantum subexponential time
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
Andrew M. Childs, David Jao, Vladimir Soukharev
JMLR
2010
107views more  JMLR 2010»
15 years 1 months ago
Learning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
Shyam Visweswaran, Gregory F. Cooper