1568 search results - page 65 / 314 » The problem of examination questions in algorithmics |
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
76
Voted
FUIN
2006
14 years 10 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
75
Voted
IJDMMM
2008
14 years 10 months ago
2008
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...