10182 search results - page 342 / 2037 » Case Studies |
142
Voted
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
173
click to vote
ICCBR
2009
Springer
15 years 11 months ago
2009
Springer
Oil well drilling is a complex process which frequently leads to operational problems. In order to deal with some of these problems, knowledge intensive case based reasoning (KiCBR...
184
click to vote
IJCAI
1993
15 years 8 months ago
1993
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
165
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
144
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Recent findings showing that the output of traffic flows at packet switches has similar characteristics as the corresponding input enable a decomposition analysis of a networ...