8647 search results - page 396 / 1730 » The Container Selection Problem |
158
click to vote
RTSS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and te...
134
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
125
click to vote
CPM
2000
Springer
15 years 9 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
149
click to vote
CCCG
1998
15 years 6 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
118
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose Genetic Algorithms to improve the feature subset selection by combining the valuable outcomes from multiple feature selection methods. This paper also motivates the use...