Sciweavers

11740 search results - page 255 / 2348
» More Problems in Rewriting
Sort
View
CTRSA
2008
Springer
100views Cryptology» more  CTRSA 2008»
15 years 8 months ago
A Latency-Free Election Scheme
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
Kristian Gjøsteen
AAAI
2006
15 years 8 months ago
A Value Theory of Meta-Learning Algorithms
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
Abraham Bagherjeiran
CORR
2008
Springer
68views Education» more  CORR 2008»
15 years 6 months ago
Locating Restricted Facilities on Binary Maps
: In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix....
Mugurel Ionut Andreica, Cristina Teodora Andreica,...
IJAR
2008
116views more  IJAR 2008»
15 years 6 months ago
Portfolio management under epistemic uncertainty using stochastic dominance and information-gap theory
Portfolio management in finance is more than a mathematical problem of optimizing performance under risk constraints. A critical factor in practical portfolio problems is severe u...
Daniel Berleant, L. Andrieu, Jean-Philippe Argaud,...
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 5 months ago
Parameterized Complexity Results in Symmetry Breaking
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
Toby Walsh