1568 search results - page 66 / 314 » The problem of examination questions in algorithmics |
101
click to vote
TCS
2010
14 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
205
Voted
PADL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...
59
Voted
SOFSEM
2004
Springer
15 years 3 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
88
Voted
APIN
2004
14 years 10 months ago
2004
In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the probl...