Sciweavers

1101 search results - page 133 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
185
Voted
ISPAN
2002
IEEE
15 years 10 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 9 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
EDCC
2005
Springer
15 years 10 months ago
Structure-Based Resilience Metrics for Service-Oriented Networks
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Ja...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 5 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
167
Voted
PPOPP
2006
ACM
15 years 11 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller