Sciweavers

12519 search results - page 2334 / 2504
» Approximation Problems Categories
Sort
View
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
15 years 11 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
GPCE
2007
Springer
15 years 11 months ago
Open multi-methods for c++
Multiple dispatch – the selection of a function to be invoked based on the dynamic type of two or more arguments – is a solution to several classical problems in object-orient...
Peter Pirkelbauer, Yuriy Solodkyy, Bjarne Stroustr...
ICS
2007
Tsinghua U.
15 years 11 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
ICS
2007
Tsinghua U.
15 years 11 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
IPSN
2007
Springer
15 years 11 months ago
Interface contracts for TinyOS
TinyOS applications are built with software components that communicate through narrow interfaces. Since components enable finegrained code reuse, this approach has been successf...
Will Archer, Philip Levis, John Regehr
« Prev « First page 2334 / 2504 Last » Next »