1071 search results - page 89 / 215 » Programming with enumerable sets of structures |
ECOOP
2004
Springer
15 years 6 months ago
2004
Springer
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
113
click to vote
AICCSA
2007
IEEE
15 years 7 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
121
click to vote
JMLR
2012
13 years 3 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
126
click to vote
LOPSTR
2005
Springer
15 years 6 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
109
Voted
ICSE
2004
IEEE-ACM
16 years 22 days ago
2004
IEEE-ACM
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...