4679 search results - page 25 / 936 » Modeling When Connections Are the Problem |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
NIPS
2003
14 years 11 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
WSC
2007
15 years 3 days ago
2007
This paper investigates the applicability of the CSPI reference models in different factory planning scenarios. These scenarios are taken from real industrial use cases. The CSPI ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
VC
2002
14 years 9 months ago
2002
The recent transition from meshing the whole model towards the independent meshing of the assembly parts introduced new challenges also in the task of visualizing and pre-processi...