1951 search results - page 99 / 391 » An algorithm for improving graph partitions |
136
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
157
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
133
click to vote
WAIM
2007
Springer
15 years 10 months ago
2007
Springer
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
142
click to vote
IMR
1998
Springer
15 years 8 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
124
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...