Sciweavers

7106 search results - page 1031 / 1422
» Restricted Complexity, General Complexity
Sort
View
ECOOP
2010
Springer
15 years 11 months ago
Essential AOP: The A Calculus
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
Bruno De Fraine, Erik Ernst, Mario Südholt
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 11 months ago
Configuration of a genetic algorithm for multi-objective optimisation of solar gain to buildings
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
Ralph Evins
GECCO
2010
Springer
196views Optimization» more  GECCO 2010»
15 years 11 months ago
Using synthetic test suites to empirically compare search-based and greedy prioritizers
The increase in the complexity of modern software has led to the commensurate growth in the size and execution time of the test suites for these programs. In order to address this...
Zachary D. Williams, Gregory M. Kapfhammer
ICSE
2010
IEEE-ACM
15 years 11 months ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers
« Prev « First page 1031 / 1422 Last » Next »