Sciweavers

1242 search results - page 125 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
15 years 10 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
CHI
2010
ACM
15 years 4 months ago
Measuring environments for public displays: a space syntax approach
This paper reports on an on-going project, which is investigating the role that location plays in the visibility of information presented on a public display. Spatial measures are...
Sheep N. Dalton, Paul Marshall, Ruth Conroy Dalton
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 4 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
CSR
2007
Springer
15 years 4 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur