Sciweavers

5289 search results - page 590 / 1058
» Evolutionary Computation for Modeling and Optimization
Sort
View
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 1 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
TIT
2008
187views more  TIT 2008»
15 years 6 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
INFOCOM
2009
IEEE
16 years 1 months ago
Using Failure Models for Controlling Data Availability in Wireless Sensor Networks
— This paper presents Pirrus, a replica management system that addresses the problem of providing data availability on a wireless sensor network. Pirrus uses probabilistic failur...
Riccardo Crepaldi, Mirko Montanari, Indranil Gupta...
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
16 years 1 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 7 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...