12519 search results - page 175 / 2504 » Approximation Problems Categories |
172
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
161
click to vote
WCE
2007
15 years 7 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
155
click to vote
SIAMJO
2002
15 years 6 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
147
click to vote
CEC
2007
IEEE
16 years 24 days ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
183
click to vote
ISCC
2005
IEEE
16 years 20 hour ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...