Sciweavers

4934 search results - page 640 / 987
» complexity 2008
Sort
View
TON
2002
138views more  TON 2002»
15 years 6 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
TOSEM
2002
153views more  TOSEM 2002»
15 years 6 months ago
Automated abstraction of class diagrams
d Abstraction of Class Diagrams ALEXANDER EGYED Teknowledge Corporation Designers can easily become overwhelmed with details when dealing with large class diagrams. icle presents a...
Alexander Egyed
TPDS
2002
126views more  TPDS 2002»
15 years 6 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
TSE
2002
119views more  TSE 2002»
15 years 6 months ago
Testing Homogeneous Spreadsheet Grids with the "What You See Is What You Test" Methodology
Although there has been recent research into ways to design environments that enable end users to create their own programs, little attention has been given to helping these end u...
Margaret M. Burnett, Andrei Sheretov, Bing Ren, Gr...
TVCG
2002
109views more  TVCG 2002»
15 years 6 months ago
Robust Creation of Implicit Surfaces from Polygonal Meshes
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
Gary D. Yngve, Greg Turk