]> BibSonomy publications for /author/Balakrishnan http://www.bibsonomy.org/burst/author/Balakrishnan BibSonomy BuRST Feed for /author/Balakrishnan 2008-07-20T23:23:21+02:00 Exploring the feasibility of video mail for illiterate users. dblphttp://www.bibsonomy.org/bibtex/28aac5a535bb2e94d9746346be720017f/dblp dblp 2008-07-13T00:00:00+02:00 dblp
Exploring the feasibility of video mail for illiterate users.
Archana Prasad and Indrani Medhi and Kentaro Toyama and Ravin Balakrishnan AVI 103-110 (2008)
to dblp by dblp on 2008-07-13 00:00:00 ]]> AVIconf/avi/2008103-110Exploring the feasibility of video mail for illiterate users.2008dblp 2008-07-13 00:00:00.0 Modelling and Querying the Expressive Semantics of Dance Videos. dblphttp://www.bibsonomy.org/bibtex/2d935fa3873849f3c34c69833030648e3/dblp dblp 2008-06-20T00:00:00+02:00 dblp
Modelling and Querying the Expressive Semantics of Dance Videos.
Balakrishnan Ramadoss and Kannan Rajkumar JIKM 5 193-210 (2006)
to dblp by dblp on 2008-06-20 00:00:00 ]]> JIKM3193-210Modelling and Querying the Expressive Semantics of Dance Videos.52006dblp 2008-06-20 00:00:00.0 A New Methodology For Emergent System Identification Using Particle Swarm Optimization (PSO) And The Group Mehtod Data Handling (GMDH) http://www.bibsonomy.org/bibtex/21b8b37637c22059b6cb9e9dd7be9a082/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 GMDH, PSO, algorithms, applications, data for genetic group handling, identification method optimization, particle programming, real swarm system world
A New Methodology For Emergent System Identification Using Particle Swarm Optimization (PSO) And The Group Mehtod Data Handling (GMDH)
Mark S. Voss and Xin Feng GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 1227--1232 (2002)
to GMDH, PSO, algorithms, applications, data for genetic group handling, identification method optimization, particle programming, real swarm system world by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July1227--1232A New Methodology For Emergent System Identification Using Particle Swarm Optimization ({PSO}) And The Group Mehtod Data Handling ({GMDH})2002GMDH, PSO, algorithms, applications, data for genetic group handling, identification method optimization, particle programming, real swarm system world 2008-06-19 17:46:40.0 An Application Service Provider Approach For Hybrid Evolutionary Algorithm-based Real-world Flexible Job Shop Scheduling Problem http://www.bibsonomy.org/bibtex/2a1ca23cd9f8f366d205e0f86bf1b347a/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 algorithm, algorithms, application applications, evolutionary genetic job programming, provider real scheduling, service, shop world
An Application Service Provider Approach For Hybrid Evolutionary Algorithm-based Real-world Flexible Job Shop Scheduling Problem
Ivan T. Tanev and Takashi Uozumi and Yoshiharu Morotome GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 1219--1226 (2002)
to algorithm, algorithms, application applications, evolutionary genetic job programming, provider real scheduling, service, shop world by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July1219--1226An Application Service Provider Approach For Hybrid Evolutionary Algorithm-based Real-world Flexible Job Shop Scheduling Problem2002algorithm, algorithms, application applications, evolutionary genetic job programming, provider real scheduling, service, shop world 2008-06-19 17:46:40.0scheduling of customers' orders in factories of plastic injection machines (FPIM) as a case of real-world flexible job shop scheduling problem (FJSS). The objective of discussed work is to provide FPIM with high business speed which implies (a) providing a customers with convenient way for remote online access to the factory's database and (b) developing an efficient scheduling routine for planning the assignment of the submitted customers' orders to FPIM machines. Remote online access to FPIM database, approached via delivering the software as a Web-service in accordance with the application service provider (ASP) paradigm is proposed. As an approach addressing the issue of efficient scheduling routine a hybrid evolutionary algorithm (HEA) combining priority-dispatching rules (PDRs) with GA, is developed. An implementation of HEA as a database stored procedure is discussed. Performance evaluation results are presented. The results obtained for evolving a schedule of 400 customers' orders on experimental model of FPIM indicate that the business delays in order of half an hour can be achieved. Iterative Refinement Of Computational Circuits Using Genetic Programming http://www.bibsonomy.org/bibtex/265729a5488c6b3bbfaaacb09f3fac431/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 algorithms, approximation circuits, computational correction, error genetic iterative numerical programming, refinement,
Iterative Refinement Of Computational Circuits Using Genetic Programming
Matthew J. Streeter and Martin A. Keane and John R. Koza GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 877--884 (2002)
to algorithms, approximation circuits, computational correction, error genetic iterative numerical programming, refinement, by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July877--884Iterative Refinement Of Computational Circuits Using Genetic Programming2002algorithms, approximation circuits, computational correction, error genetic iterative numerical programming, refinement, 2008-06-19 17:46:40.0 Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms http://www.bibsonomy.org/bibtex/2a792a83f9101046b8c57fbe6eee4174b/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 algorithms, genetic programming
Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms
Christopher R. Stephens and Riccardo Poli and Alden H. Wright and Jonathan E. Rowe GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 578--585 (2002)
to algorithms, genetic programming by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July578--585Exact Results From {A} Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms2002algorithms, genetic programming 2008-06-19 17:46:40.0 On The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms http://www.bibsonomy.org/bibtex/2a8572cf0e8772137448a2e89849d8d0b/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 Geiringer's algorithms algorithms, crossover, equilibrium, genetic homologous length linkage programming, schema theorem, theory, variable
On The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms
Riccardo Poli and Christopher R. Stephens and Alden H. Wright and Jonathan E. Rowe GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 868--876 (2002)
to Geiringer's algorithms algorithms, crossover, equilibrium, genetic homologous length linkage programming, schema theorem, theory, variable by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July868--876On The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms2002Geiringer's algorithms algorithms, crossover, equilibrium, genetic homologous length linkage programming, schema theorem, theory, variable 2008-06-19 17:46:40.0 Self-improvement For The ADATE Automatic Programming System http://www.bibsonomy.org/bibtex/2ed1dfb2f37745c262d1edf68712dc240/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 ADATE algorithms, automatic evolution, genetic method, mutation neutral paper, poster programming, self-improvement,
Self-improvement For The ADATE Automatic Programming System
Roland Olsson and Brock Wilcox GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 893 (2002)
to ADATE algorithms, automatic evolution, genetic method, mutation neutral paper, poster programming, self-improvement, by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July893Self-improvement For The {ADATE} Automatic Programming System2002ADATE algorithms, automatic evolution, genetic method, mutation neutral paper, poster programming, self-improvement, 2008-06-19 17:46:40.0 MB GP In Modelling And Prediction http://www.bibsonomy.org/bibtex/2dab11fff6401636a86c11a9a82c8eb34/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 algorithms, encoding, genetic modelling, paper, poster prediction programming,
MB GP In Modelling And Prediction
Carlos Oliver-Morales and Katya {Rodr{\'\i}guez V{\'a}zquez} GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference 892 (2002)
to algorithms, encoding, genetic modelling, paper, poster prediction programming, by brazovayeye on 2008-06-19 17:46:40 ]]> New YorkGECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference9-13 July892{MB GP} In Modelling And Prediction2002algorithms, encoding, genetic modelling, paper, poster prediction programming, 2008-06-19 17:46:40.0 Evolutionary Synthesis of Bayesian Networks for Optimization http://www.bibsonomy.org/bibtex/260720e829d70c184a48a3a372e0a5780/brazovayeye brazovayeye 2008-06-19T17:46:40+02:00 algorithms, genetic programming
Evolutionary Synthesis of Bayesian Networks for Optimization
Heinz Muehlenbein and Thilo Mahning Advances in the Evolutionary Synthesis of Intelligent Agents 429- (2001)
to algorithms, genetic programming by brazovayeye on 2008-06-19 17:46:40 ]]> Advances in the Evolutionary Synthesis of Intelligent Agents15March429-Evolutionary Synthesis of Bayesian Networks for Optimization2001algorithms, genetic programming 2008-06-19 17:46:40.0We shortly review our theoretical analysis of genetic algorithms and provide some new results. The theory has lead to the design of three different algorithms, all based on probability distributions instead of recombination of strings. In order to be numerically tractable, the probability distribution has to be factored into a small number of factors. Each factor should depend on a small number of variables only. For certain applications the factorisation can be explicitly determined. In general it has to be determined from the search points used for the optimisation. Computing the factorization from the data leads to learning Bayesian networks. The problem of finding a minimal structure which explains the data is discussed in detail. It is shown that the Bayesian Information Criterion is a good score for this problem. The algorithms are extended to probabilistic prototype trees used for synthesising programs.