11211 search results - page 1660 / 2243 » Rank-Sensitive Data Structures |
217
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design deci...
196
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
175
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
201
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
This article is about a measurement analysis based approach to help software practitioners in managing the additional level complexities and variabilities in software product line...
195
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...