124 resultados para GREAT CRASH
Resumo:
Course Scheduling consists of assigning lecture events to a limited set of specific timeslots and rooms. The objective is to satisfy as many soft constraints as possible, while maintaining a feasible solution timetable. The most successful techniques to date require a compute-intensive examination of the solution neighbourhood to direct searches to an optimum solution. Although they may require fewer neighbourhood moves than more exhaustive techniques to gain comparable results, they can take considerably longer to achieve success. This paper introduces an extended version of the Great Deluge Algorithm for the Course Timetabling problem which, while avoiding the problem of getting trapped in local optima, uses simple Neighbourhood search heuristics to obtain solutions in a relatively short amount of time. The paper presents results based on a standard set of benchmark datasets, beating over half of the currently published best results with in some cases up to 60% of an improvement.
Resumo:
The utilization of the computational Grid processor network has become a common method for researchers and scientists without access to local processor clusters to avail of the benefits of parallel processing for compute-intensive applications. As a result, this demand requires effective and efficient dynamic allocation of available resources. Although static scheduling and allocation techniques have proved effective, the dynamic nature of the Grid requires innovative techniques for reacting to change and maintaining stability for users. The dynamic scheduling process requires quite powerful optimization techniques, which can themselves lack the performance required in reaction time for achieving an effective schedule solution. Often there is a trade-off between solution quality and speed in achieving a solution. This paper presents an extension of a technique used in optimization and scheduling which can provide the means of achieving this balance and improves on similar approaches currently published.
Resumo:
During recent reinvestigations in the Great Cave of Niah in Borneo, the ‘Hell Trench’ sedimentary sequence seen by earlier excavators was re-exposed. Early excavations here yielded the earliest anatomically-modern human remains in island Southeast Asia. Calibrated radiocarbon dates, pollen, algal microfossils, palynofacies, granulometry and geochemistry of the ‘Hell Trench’ sequence provide information about environmental and vegetational changes, elements of geomorphic history and information about human activity. The ‘Hell’ sediments were laid down episodically in an ephemeral stream or pool. The pollen suggests cyclically changing vegetation with forest habitats alternating with more open environments; indicating that phases with both temperatures and precipitation reduced compared with the present. These events can be correlated with global climate change sequences to produce a provisional dating framework. During some forest phases, high counts of Justicia, a plant which today colonises recently burnt forest areas, point to fire in the landscape. This may be evidence for biomass burning by humans, presumably to maintain forest-edge habitats. There is evidence from palynofacies for fire on the cave floor in the ‘Hell’ area. Since the area sampled is beyond the limit of plant growth, this is evidence for human activity. The first such evidence is during an episode with significant grassland indicators, suggesting that people may have reached the site during a climatic phase characterised by relatively open habitats ~50 ka. Thereafter, people were able to maintain a relatively consistent presence at Niah. The human use of the ‘Hell’ area seems to have intensified through time, probably because changes in the local hydrological regime made the area dryer and more suitable for human use.