Sciweavers

1969 search results - page 124 / 394
» Financial Theory 1
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 3 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
16 years 1 months ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
16 years 28 days ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 10 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
SIGSOFT
1996
ACM
15 years 10 months ago
Using Object-Oriented Typing to Support Architectural Design in the C2 Style
Abstract -- Software architectures enable large-scale software development. Component reuse and substitutability, two key aspects of large-scale development, must be planned for du...
Nenad Medvidovic, Peyman Oreizy, Jason E. Robbins,...