1554 search results - page 47 / 311 » Parameterized Complexity and Approximation Algorithms |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
82
Voted
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
173
Voted
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
PSIVT
2007
Springer
15 years 4 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
106
click to vote
ASAP
2004
IEEE
15 years 1 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...