6110 search results - page 735 / 1222 » Approximate Computing |
155
click to vote
CSCLP
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
181
click to vote
EMO
2003
Springer
16 years 2 days ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
165
click to vote
ESA
2003
Springer
16 years 2 days ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
167
click to vote
FM
2003
Springer
16 years 2 days ago
2003
Springer
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
191
click to vote
ICCBR
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...