Converging on Program Simplicity
نویسنده
چکیده
منابع مشابه
Adaptive representation for single objective optimization
A new technique called Adaptive Representation Evolutionary Algorithm (AREA) is proposed in this paper. AREA involves dynamic alphabets for encoding solutions. The proposed adaptive representation is more compact than binary representation. Genetic operators are usually more aggressive when higher alphabets are used. Therefore the proposed encoding ensures an efficient exploration of the search...
متن کاملOn a Combinatorial Property of Families of of Sequences Converging to ∞
This is the Plain-Tex version of a paper that has been accepted for publication in the Journal of Natural Geometry–an international quarterly that started publication in 1992 with the stated aim of bringing unity through simplicity in the mathematics of natural structures. The address of the journal can be found in the indices of the Mathematical Reviews. Abstract. We consider families Φ of seq...
متن کاملA New Solution to the Puzzle of Simplicity
Explaining the connection, if any, between simplicity and truth is among the deepest problems facing the philosophy of science, statistics, and machine learning. Say that an efficient truth finding method minimizes worst case costs en route to converging to the true answer to a theory choice problem. Let the costs considered include the number of times a false answer is selected, the number of ...
متن کاملTechnoscience and Convergence: a Transmutation of Values? Summerschool on Ethics of Converging Technologies
Technoscience is often perceived as an expression of the primacy of utilitarian values that would take over the field of pure and disinterested science. A number of scientists deplore that the age of science for its own sake is coming to an end (Lévy-Leblond, 2000). This common view expressed by active scientists is shared and developed by historians. In a paper describing technoscience as a cu...
متن کاملA Note on Converging Geometric-type Processes
The process of deterioration of repairable systems with each repair is modeled using converging geometric-type processes. It is proved that the expectation of the number of repairs in each interval of time is infinite. A new regularization procedure is suggested and the corresponding optimization problem is discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Computer
دوره 30 شماره
صفحات -
تاریخ انتشار 1997