4110 search results - page 24 / 822 » Efficient algorithms for the 2-gathering problem |
117
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
137
Voted
TWC
2008
15 years 3 months ago
2008
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
137
click to vote
DCG
2000
15 years 3 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
111
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
105
Voted
NA
2008
15 years 3 months ago
2008
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...