Sciweavers

10392 search results - page 1755 / 2079
» Introduction to Computer Science
Sort
View
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
16 years 1 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ATAL
2009
Springer
16 years 1 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»
16 years 1 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»
16 years 1 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»
16 years 1 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
« Prev « First page 1755 / 2079 Last » Next »