16404 search results - page 429 / 3281 » A set coverage problem |
156
click to vote
GBRPR
2007
Springer
16 years 28 days ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
164
click to vote
QEST
2006
IEEE
16 years 23 days ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
177
click to vote
WABI
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
198
click to vote
AISC
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
176
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...