Sciweavers

5889 search results - page 470 / 1178
» Graph Layout Problems
Sort
View
ENC
2004
IEEE
15 years 11 months ago
A New Cache Approach Based on Graph for Web Servers
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
Euloge Edi, Denis Trystram, Jean-Marc Vincent
CASCON
1997
93views Education» more  CASCON 1997»
15 years 9 months ago
Repairing software style using graph grammars
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to confor...
Hoda Fahmy, Richard C. Holt, Spiros Mancoridis
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 8 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 7 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
IPL
2008
146views more  IPL 2008»
15 years 7 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol