Sciweavers

923 search results - page 137 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 6 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 6 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
MLG
2007
Springer
15 years 6 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
FUZZY
2004
Springer
170views Fuzzy Logic» more  FUZZY 2004»
15 years 5 months ago
Consistency Conditions for Fuzzy Choice Functions
The revealed preference is a central subject in classical consumer theory. Authors like Samuelson, Arrow, Richter, Sen, Uzawa and others have proposed an axiomatic setting of reve...
Irina Georgescu
COLT
1999
Springer
15 years 4 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon