Sciweavers

1458 search results - page 206 / 292
» The sequentially realizable functionals
Sort
View
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
AAAI
2007
15 years 6 months ago
Online Co-Localization in Indoor Wireless Networks by Dimension Reduction
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals that come in a stream manner, a problem which we call onli...
Jeffrey Junfeng Pan, Qiang Yang, Sinno Jialin Pan
FLAIRS
2007
15 years 6 months ago
Context-Sensitive MTL Networks for Machine Lifelong Learning
Context-sensitive Multiple Task Learning, or csMTL, is presented as a method of inductive transfer that uses a single output neural network and additional contextual inputs for le...
Daniel L. Silver, Ryan Poirier
ATAL
2006
Springer
15 years 6 months ago
Evaluating bidding strategies for simultaneous auctions
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
Teddy Candale, Sandip Sen
AAAI
2010
15 years 5 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting