6562 search results - page 138 / 1313 » Noetherianity and Combination Problems |
121
click to vote
ECML
1997
Springer
15 years 9 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...
142
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
136
click to vote
CCCG
2007
15 years 6 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
107
click to vote
EOR
2010
15 years 4 months ago
2010
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
127
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...