1977 search results - page 114 / 396 » The satisfactory partition problem |
147
click to vote
EOR
2008
15 years 6 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
142
click to vote
ECML
1997
Springer
15 years 10 months ago
1997
Springer
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
152
click to vote
MIC
2003
15 years 7 months ago
2003
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
137
click to vote
JAL
2002
15 years 5 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
252
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...