Sciweavers

584 search results - page 82 / 117
» Efficient mass decomposition
Sort
View
NETWORKING
2000
13 years 10 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
WCE
2007
13 years 10 months ago
Modified Memory Convergence with Fuzzy PSO
—Associative neural memories are models of biological phenomena that allow for the storage of pattern associations and the retrieval of the desired output pattern upon presentati...
Subhash Chandra Pandey, P. K. Mishra
GISCIENCE
2008
Springer
115views GIS» more  GISCIENCE 2008»
13 years 10 months ago
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
Edward Verbree, Hang Si
CAD
2006
Springer
13 years 9 months ago
Geometric constraints within feature hierarchies
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
Meera Sitharam, Jianjun Oung, Yong Zhou, Adam Arbr...
CPC
2006
93views more  CPC 2006»
13 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang