FECS
2006
13 years 6 months ago
2006
- The complete history of problem solving in computer sciences is a history of continuous attempts to discover, study, mimic and implement ideas, models, metaphors, and sequences f...
EUROPLOP
2006
13 years 6 months ago
2006
We present a set of methods to enable a cross-domain reuse of problem solutions via analysis patterns. First, problem-context descriptions and problemcontext models as well as sol...
CSC
2006
13 years 6 months ago
2006
Abstract: Tikhonov regularization is a popular and effective method for the approximate solution of illposed problems, including Fredholm equations of the first kind. The Tikhonov ...
SPLC
2008
13 years 6 months ago
2008
Scalability is recognized as a key challenge in the automated analysis of Feature Models (FMs). Current solutions in this context mainly propose using different logic paradigms as...
NIPS
2008
13 years 6 months ago
2008
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
EWCBR
2008
Springer
13 years 6 months ago
2008
Springer
"Similar problems have similar solutions" is a basic tenet of case-based inference. However this is not satisfied for CBR systems where the task is to achieve original so...
EWCBR
2008
Springer
13 years 6 months ago
2008
Springer
Textual-case based reasoning (TCBR) systems where the problem and solution are in free text form are hard to evaluate. In the absence of class information, domain experts are neede...
AIPS
2008
13 years 7 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
FLAIRS
2010
13 years 7 months ago
2010
Most researchers agree that there is a continuum between well-definedness and ill-definedness. However, positioning a specific problem within this continuum is not always easy. To...
AIPS
2010
13 years 7 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...