12519 search results - page 293 / 2504 » Approximation Problems Categories |
182
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
180
click to vote
IDEAS
2007
IEEE
16 years 28 days ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
159
click to vote
IROS
2007
IEEE
16 years 28 days ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
176
click to vote
FORMATS
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
164
click to vote
ICANN
2007
Springer
16 years 23 days ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...