Filters








16 Hits in 2.6 sec

Second order heuristics in ACGP

Cezary Z. Janikow, John W. Aleshunas, Mark W. Hauschild
2011 Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11  
Recently, they have been extended to second-order (parent-children) heuristics.  ...  This paper describes the second-order processing, and illustrates the usefulness and efficiency of this approach using a simple problem specifically constructed to exhibit strong second-order structure  ...  Illustration of a) global first-order and b) local second-order heuristics. In ACGP, there are two kinds of heuristics.  ... 
doi:10.1145/2001858.2002066 dblp:conf/gecco/JanikowAH11 fatcat:s25lphyunfgmtgvp32xn5ia7cy

Cost-benefit analysis of using heuristics in ACGP

John Aleshunas, Cezary Janikow
2011 2011 IEEE Congress of Evolutionary Computation (CEC)  
Recently, the same advantage has been shown for second-order heuristics: parent-children probabilities.  ...  Adaptable CGP (ACGP) is a method for discovery of the heuristics. CGP and ACGP have previously demonstrated their capabilities using first-order heuristics: parent-child probabilities.  ...  OH 1st OH Base Figure 3 Comparison of Base, first order and second order heuristics in ACGP When ACGP is executed with second order heuristics, it is capable of differentiating among the above nine  ... 
doi:10.1109/cec.2011.5949749 dblp:conf/cec/AleshunasJ11 fatcat:ne2gun6pvvcazbedcvmay5xcoe

Evolving problem heuristics with on-line ACGP

Cezary Z. Janikow
2007 Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation - GECCO '07  
This paper overviews ACGP, pointing out its strength and limitations in the off-line mode.  ...  However, in general the user may not be aware of the best representation space, including heuristics, to solve a particular problem.  ...  The second problem can be explained as follow.  ... 
doi:10.1145/1274000.1274017 dblp:conf/gecco/Janikow07 fatcat:as66dop7tbakdmgndtcvvq2iru

Adapting Representation in Genetic Programming [chapter]

Cezary Z. Janikow
2004 Lecture Notes in Computer Science  
In this paper, we present a methodology, which extracts and utilizes local heuristics aiming at improving search efficiency.  ...  The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees.  ...  The ACGP algorithm presented here implements a technique based on distribution of local first-order (parent-child) contexts in the population.  ... 
doi:10.1007/978-3-540-24855-2_61 fatcat:enmafamllfagbct5ui32ltttj4

Adaptable representation in GP

Cezary Z Janikow
2005 Proceedings of the 2005 workshops on Genetic and evolutionary computation - GECCO '05  
ACGP discovers representation, in the space of probabilistic representations, one that improves the search itself and that provides the user with heuristics about the domain.  ...  Last year, ACGP methodology was introduced for extracting local problem-specific heuristics, that is for learning a local model of the problem domain.  ...  ACGP was developed to extract first-order heuristics.  ... 
doi:10.1145/1102256.1102329 dblp:conf/gecco/Janikow05 fatcat:45qcmie2wnhk7f2dqpkoapmwuu

CGP visits the Santa Fe trail

Cezary Z. Janikow, Christopher J. Mann
2005 Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05  
We also compare such user-mixed heuristics with those generated by the ACGP system which automatically extracts heuristics improving GP performance.  ...  Results show that some heuristics result in very substantial performance improvements, that complex heuristics are usually not decomposable, and that the heuristics generalize to apply to other similar  ...  As we can see in figure 20 , the ACGP discovered heuristics clearly outperform our best heuristics, even CJM.  ... 
doi:10.1145/1068009.1068293 dblp:conf/gecco/JanikowM05 fatcat:lbn2hsu7irafbjkt4slcdnjjwu

Actor-critic learning-based energy optimization for UAV access and backhaul networks

Yaxiong Yuan, Lei Lei, Thang X. Vu, Symeon Chatzinotas, Sumei Sun, Björn Ottersten
2021 EURASIP Journal on Wireless Communications and Networking  
Numerical results show that the computation time of both ACGP and ACGOP is reduced tenfold to hundredfold compared to the offline approaches, and ACGOP is better than ACGP in energy savings.  ...  Second, toward real-time decision-making, we improve the conventional AC-DRL and propose two learning schemes: AC-based user group scheduling and backhaul power allocation (ACGP), and joint AC-based user  ...  and visiting orders.  ... 
doi:10.1186/s13638-021-01960-0 pmid:34777489 pmcid:PMC8550566 fatcat:sh427lkiazfibaswp2px2xjocu

Annotation Curricula to Implicitly Train Non-Expert Annotators [article]

Ji-Ung Lee and Jan-Christoph Klie and Iryna Gurevych
2021 arXiv   pre-print
Our results show that using a simple heuristic to order instances can already significantly reduce the total annotation time while preserving a high annotation quality.  ...  To do so, we first formalize annotation curricula for sentence- and paragraph-level annotation tasks, define an ordering strategy, and identify well-performing heuristics and interactively trained models  ...  seconds).  ... 
arXiv:2106.02382v3 fatcat:5eqcrwlepvhjtnibkdepyjbljq

An Algorithmic Chemistry for Genetic Programming [chapter]

Christian W. G. Lasarczyk, Wolfgang Banzhaf
2005 Lecture Notes in Computer Science  
Therein, register machine instructions are executed in a non-deterministic order, following a probability distribution.  ...  In this contribution we discuss a new method of execution of programs introduced recently: Algorithmic Chemistries.  ...  In further work we plan to use methodologies described in [16, 17] useful to analyze and optimize evolutionary algorithms and other search heuristics.  ... 
doi:10.1007/978-3-540-31989-4_1 fatcat:5huzlbq4lrdqxlmgp7s6dqkcq4

Wireless technologies for the connectivity of the future

Filipe D Cardoso, Vlatko Lipovac, Luis M Correia
2021 EURASIP Journal on Wireless Communications and Networking  
Only the top ranked papers were invited to this Special Issue, in order to fulfil its purpose.  ...  This Special Issue originates from the international conference EuCNC 2020 (European Conference on Networks and Communications), which was planned to be held in June 2020 in Dubrovnik (Croatia), but due  ...  Numerical results show that the computation time of both ACGP and ACGOP are reduced tenfold to 100-fold compared to the offline approaches, and ACGOP is better than ACGP in energy savings.  ... 
doi:10.1186/s13638-021-01980-w pmid:33972827 pmcid:PMC8100732 fatcat:yhi24tojfvazjk7ryiaynrlayu

Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times

Silvio Alexandre de Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans
2015 INFORMS journal on computing  
Finally, a branch-and-price based heuristic is designed and computational results are reported. The heuristic scheme compares favorably or outperforms other approaches.  ...  We compare several solution methods, and propose a new efficient hybrid scheme that combines column generation and Lagrange relaxation in a novel way.  ...  In order to perform the comparison, we employed the 7 instances taken from Trigeiro et al. (1989) (2000) (BW) and our approach (HB&P).  ... 
doi:10.1287/ijoc.2014.0636 fatcat:llmi7bl3c5gmjpjgoi2n5tbzyy

ACGP: Adaptable Constrained Genetic Programming [chapter]

Cezary Z. Janikow
Genetic Programming Theory and Practice II  
Even though many specific techniques can be implemented in the methodology, in this paper we utilize information on local first-order (parent-child) distributions of the functions and terminals.  ...  The heuristics are extracted from the population by observing their distribution in "better" individuals.  ...  Building and maintaining/combining libraries of heuristics with off-line processing, to be used in on-line problem solving.  ... 
doi:10.1007/0-387-23254-0_12 fatcat:rfandwthzbbrxjdf7ch3nhlvb4

A Naturalistic Inquiry of Service-Learning in New Zealand University Classrooms: Determining and Illuminating the Impact on Student Engagement [article]

Lane Graves Perry, University Of Canterbury
2011
two different upper-division courses at the University of Canterbury in New Zealand during the second semester of the 2009 academic year.  ...  Such an investigation is relevant to New Zealand tertiary teachers, researchers, and leaders, who are interested in creating conditions that engage students in learning while developing students personally  ...  "First it should be heuristic, that is, aimed at some understanding or some action that the inquirer needs to have or take. Unless it is heuristic it is useless, however intrinsically interesting.  ... 
doi:10.26021/9723 fatcat:37gxw7qxbvcbvcwdn5u5uignqy

Partial order based approach to synthesis of speed-independent circuits

A. Semenov, A. Yakovlev, E. Pastor, M.A. Pena, J. Cortadella, L. Lavagno
Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems  
The new method uses partial order in the form of the STG-unfolding segment to derive the logic implementation using approximation techniques.  ...  The experimental results show the power of the approximation approach in comparison with the existing methods.  ...  Table 1 presents total time spent (in seconds) on synthesis of speed-independent circuits from their STG specifications in the ACGpS architecture ("PUNT ACGpS").  ... 
doi:10.1109/async.1997.587179 dblp:conf/async/SemenovYPPCL97 fatcat:cob42347pfbahmv3fk2l4jrotq

Rapid digital architecture design of orthogonal matching pursuit

Benjamin Knoop, Jochen Rust, Sebastian Schmale, Dagmar Peters-Drolshagen, Steffen Paul
2016 2016 24th European Signal Processing Conference (EUSIPCO)  
., in C++.  ...  Algorithmic modifications and improvements are described to incorporate the notion of sparse-coded signals and their recovery in the context of multi-user wireless communications in a wireless sensor network  ...  SQRD permutes the detection order heuristically such that data of nodes where Π is a permutation matrix, which determines the ordering of the subsequent detection.  ... 
doi:10.1109/eusipco.2016.7760570 dblp:conf/eusipco/KnoopRSPP16 fatcat:bo3c4fo6njeo3hjjsnwo72jbwe
« Previous Showing results 1 — 15 out of 16 results