4865 search results - page 394 / 973 » The Complexity of Graph Connectivity |
189
click to vote
JSA
2000
15 years 6 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
196
click to vote
SIAMDM
1998
15 years 6 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
167
click to vote
SEMCO
2007
IEEE
16 years 1 months ago
2007
IEEE
Model-driven development depends on good initial models. Creating these models by hand is a challenging task, because of complex specification documents and change requests. We p...
264
click to vote
GMP
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
176
click to vote
ESANN
2006
15 years 8 months ago
2006
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...