4926 search results - page 350 / 986 » Two Graph Algorithms On an Associative Computing Model |
187
click to vote
ICCSA
2005
Springer
16 years 25 days ago
2005
Springer
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
177
click to vote
MICCAI
2003
Springer
16 years 8 months ago
2003
Springer
A generalized image model (GIM) is presented. Images are represented as sets of four-dimensional (4D) sites combining position and intensity information, as well as their associat...
211
click to vote
AIMS
2007
Springer
16 years 1 months ago
2007
Springer
This paper proposes an optimization method for the design of large scale confederation based BGP networks. We propose a graph based model and an associated metric to evaluate the r...
176
click to vote
IPPS
2003
IEEE
16 years 18 days ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
182
click to vote
TCS
2010
15 years 5 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...