4266 search results - page 151 / 854 » The container loading problem |
143
click to vote
NETWORKS
2011
14 years 10 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
118
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
152
click to vote
RTSS
2005
IEEE
15 years 9 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...
126
click to vote
SWAT
2004
Springer
15 years 9 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...
117
click to vote
CPM
2000
Springer
15 years 8 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...