Sciweavers

57 search results - page 1 / 12
» N Degrees of Separation: Multi-Dimensional Separation of Con...
Sort
View
ICSE
1999
IEEE-ACM
13 years 9 months ago
N Degrees of Separation: Multi-Dimensional Separation of Concerns
Peri L. Tarr, Harold Ossher, William H. Harrison, ...
RE
2005
Springer
13 years 10 months ago
Multi-Dimensional Separation of Concerns in Requirements Engineering
Existing requirements engineering approaches manage broadly scoped requirements and constraints in a fashion that is largely two-dimensional, where functional requirements serve a...
Ana Moreira, Awais Rashid, João Araú...
SIGSOFT
2003
ACM
13 years 10 months ago
Refinements and multi-dimensional separation of concerns
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
Don S. Batory, Jia Liu, Jacob Neal Sarvela
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 5 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
EJC
2010
13 years 5 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...