28 search results - page 4 / 6 » swat 2010 |
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. W...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
SWAT
2010
Springer
13 years 2 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
ENVSOFT
2007
13 years 4 months ago
2007
The project goal was to loosely couple the SWAT model and the QUAL2E model and compare their combined ability to predict total phosphorus (TP) and NO3-N plus NO2-N yields to the a...