3775 search results - page 487 / 755 » The Expression Problem Revisited |
164
click to vote
DEXA
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
179
click to vote
DSOM
2005
Springer
16 years 7 days ago
2005
Springer
We present a design for policy-based performance management of SMS Systems. The design takes as input the operator’s performance goals, which are expressed as policies that can b...
157
Voted
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
179
click to vote
CAISE
2004
Springer
16 years 3 days ago
2004
Springer
UML class diagrams can be used as a language for expressing a conceptual model of a domain. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL) ...
179
click to vote
CP
2004
Springer
16 years 3 days ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...