1046 search results - page 60 / 210 » Approximation Algorithms for Domination Search |
88
Voted
CORR
2007
Springer
15 years 13 days ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
IJCAI
1989
15 years 1 months ago
1989
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
156
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
121
click to vote
ALGORITHMICA
2010
15 years 18 days ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
125
click to vote
SOFSEM
2000
Springer
15 years 4 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...