4266 search results - page 300 / 854 » The container loading problem |
126
click to vote
DM
2002
15 years 4 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
144
click to vote
IPL
2007
15 years 4 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
117
click to vote
AUTOMATICA
1999
15 years 4 months ago
1999
This paper considers the problem of balanced model reduction for a class of distributed parameter systems. The system is assumed to have a finite-dimensional state vector as well ...
139
click to vote
CCE
2008
15 years 4 months ago
2008
Scheduling of processes in mixed batch/continuous plants, due to their hybrid nature can become very complex. This paper presents the Timed Hybrid Petri net (THPN) as a suitable t...
176
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...