Sciweavers

11345 search results - page 1982 / 2269
» Foundations of Computer Science
Sort
View
120
Voted
ATAL
2009
Springer
15 years 10 months ago
Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
L. Julian Schvartzman, Michael P. Wellman
BTW
2009
Springer
119views Database» more  BTW 2009»
15 years 10 months ago
On the Need of Data Management in Automotive Systems
Abstract: In the last decade, automotive systems changed from traditional mechanical or mechatronical systems towards software intensive systems, because more and more functionalit...
Sandro Schulze, Mario Pukall, Gunter Saake, Tobias...
BTW
2009
Springer
142views Database» more  BTW 2009»
15 years 10 months ago
Bridging the Gap between Variability in Client Application and Database Schema
: Database schemas are used to describe the logical design of a database. Diverse groups of users have different perspectives on the schema which leads to different local schemas. ...
Norbert Siegmund, Christian Kästner, Marko Ro...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 10 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
15 years 10 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
« Prev « First page 1982 / 2269 Last » Next »