1253 search results - page 37 / 251 » order 2000 |
74
Voted
COMBINATORICS
2000
14 years 10 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
PR
2000
14 years 10 months ago
2000
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search f...
MOC
1998
14 years 10 months ago
1998
In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in a paper by Shu and Osher, suitable for solvi...
76
Voted
MOBICOM
2000
ACM
15 years 3 months ago
2000
ACM
In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin man...
84
Voted
AMC
2007
14 years 11 months ago
2007
We develop several iterative methods for computing generalized inverses using both first and second order optimization methods in C∗ -algebras. Known steepest descent iterative...