Sciweavers

26354 search results - page 344 / 5271
» How we refactor, and how we know it
Sort
View
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
15 years 6 months ago
Non-Repetitive Tilings
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
James D. Currie, Jamie Simpson
ICCBR
2010
Springer
15 years 4 months ago
Amalgams: A Formal Approach for Combining Multiple Case Solutions
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine s...
Santiago Ontañón, Enric Plaza
CSMR
2007
IEEE
16 years 1 months ago
The Sisyphus Continuous Integration System
Integration hell is a prime example of software evolution gone out of control. The Sisyphus continuous integration system is designed to prevent this situation in the context of c...
Tijs van der Storm
IHM
2006
ACM
16 years 24 days ago
ExploraGraph et la personnalisation des interactions pour l'apprentissage
This paper describes how the different dimensions of personalization can be integrated in an environment designed to support learning. We show how the ExploraGraph environment int...
Aude Dufresne, Sandrine PromTep
SIGSOFT
2003
ACM
16 years 2 days ago
Eliminating redundancies with a "composition with adaptation" meta-programming technique
Redundant code obstructs program understanding and contributes to high maintenance costs. While most experts agree on that, opinions on how serious the problem of redundancies rea...
Stan Jarzabek, Shubiao Li