Sciweavers

716 search results - page 112 / 144
» Modelling Bounded Rationality Using Evolutionary Techniques
Sort
View
115
Voted
EUROCRYPT
2007
Springer
15 years 9 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
162
Voted
ALT
2002
Springer
16 years 13 days ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
EICS
2009
ACM
15 years 8 months ago
Adapting ubicomp software and its evaluation
We describe work in progress on tools and infrastructure to support adaptive component-based software for mobile devices— in our case, Apple iPhones. Our high level aim is ‘de...
Malcolm Hall, Marek Bell, Alistair Morrison, Stuar...
127
Voted
FM
2005
Springer
98views Formal Methods» more  FM 2005»
15 years 9 months ago
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...
Richard Banach, Michael Poppleton, Czeslaw Jeske, ...
158
Voted
CUZA
2002
132views more  CUZA 2002»
15 years 3 months ago
A Process Algebra for Predictible Control Systems
This paper presents Process Algebra for Predictible Control Systems (PAPCS) as a model for specifying and analysis of concurrent, time and resource dependent, distributed control s...
Nicolae Marian