2654 search results - page 341 / 531 » On Pairing Inversion Problems |
144
click to vote
EOR
2002
15 years 4 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
144
click to vote
JMIV
2000
15 years 4 months ago
2000
A general paradigm for recognizing 3D objects is offered, and applied to some geometric primitives (spheres, cylinders, cones, and tori). The assumption is that a curve on the surf...
133
click to vote
MOC
2000
15 years 4 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
137
click to vote
DCG
1999
15 years 4 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
126
click to vote
TCS
1998
15 years 4 months ago
1998
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...