Sciweavers

139 search results - page 2 / 28
» Knowledge base reuse through constraint relaxation
Sort
View
ICSR
2004
Springer
13 years 10 months ago
Developing Active Help for Framework Instantiation Through Case-Based Reasoning
Object-oriented frameworks are sophisticated software artifacts that significantly impact productivity when building applications in a given domain. However, frameworks are complex...
Carlos Fernández-Conde, Pedro A. Gonz&aacut...
ACISICIS
2007
IEEE
13 years 11 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
ANNS
2010
13 years 9 days ago
Search Space Restriction of Neuro-evolution through Constrained Modularization of Neural Networks
Evolving recurrent neural networks for behavior control of robots equipped with larger sets of sensors and actuators is difficult due to the large search spaces that come with the ...
Christian W. Rempis, Frank Pasemann
IWPC
2008
IEEE
13 years 11 months ago
Ensuring Well-Behaved Usage of APIs through Syntactic Constraints
Libraries are the most widespreaded form of software reuse. In order to properly use a library API, its clients should fulfill a series of (many times implicit) assumptions made ...
Martin Feilkas, Daniel Ratiu
NETWORKS
2008
13 years 5 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...