1046 search results - page 63 / 210 » Approximation Algorithms for Domination Search |
105
Voted
MP
2006
15 years 13 days ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
91
Voted
ACL
2007
15 years 1 months ago
2007
This paper proposes a novel approach to the induction of Combinatory Categorial Grammars (CCGs) by their potential affinity with the Genetic Algorithms (GAs). Specifically, CCGs...
101
Voted
AAECC
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
ISPAN
1997
IEEE
15 years 4 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
125
Voted
COCOA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...