240 resultados para Conference Graph
Resumo:
In this paper, we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality. These heuristic sequences can be seen as dynamic hybridisations of different graph colouring heuristics that construct solutions step by step. Based on these sequences, we statistically analyse the way in which graph colouring heuristics are automatically hybridised. This, to our knowledge, represents a new direction in hyper-heuristic research. It is observed that spending the search effort on hybridising Largest Weighted Degree with Saturation Degree at the early stage of solution construction tends to generate high quality solutions. Based on these observations, an iterative hybrid approach is developed to adaptively hybridise these two graph colouring heuristics at different stages of solution construction. The overall aim here is to automate the heuristic design process, which draws upon an emerging research theme on developing computer methods to design and adapt heuristics automatically. Experimental results on benchmark exam timetabling and graph colouring problems demonstrate the effectiveness and generality of this adaptive hybrid approach compared with previous methods on automatically generating and adapting heuristics. Indeed, we also show that the approach is competitive with the state of the art human produced methods.
Resumo:
Presented as part of the twentieth anniversary celebrations of the International Federation for Research in Women's History in Sofia in August 2007, this paper examines the association's newsletter to explore what it reveals about the expansion of the academic infrastructure for women's history from 1987 to 2007. It looks at the rapid advancement of the subject in the 1980s and early 1990s and its slower growth in the following decade. It also explores briefly the problems that the establishment of Women's Studies Centres presented for women's history.
Resumo:
We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven, or eight qubits, we show that success probabilities of 1/4, 1/2, and 1, respectively, can be achieved. Our study puts a measurement-based version of this important quantum logic gate within the reach of current experiments. As the graphs are setup independent, they could be realized in a variety of systems, including linear optics and ion traps.
Resumo:
This brief paper represents the reflections of a participant at the recent conference ‘The Physical Punishment of Children’ organised jointly by Child Care in Practice and The Office of Law Reform. The participant’s reflections are related to his roles both as a Family Therapist and as a Guardian Ad Litem. The writer largely accepts the academic and moral arguments in respect of making the physical punishment of children a legal offence, so eloquently put by the main speakers. He wishes, however, to draw out some of the practical and practice implications which need to be considered alongside the implementation of such legislative change.
Resumo:
An analysis of the UN 2006 COP.