409 search results - page 32 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
FOCM
2011
14 years 1 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We extend the hyperdynamics method developed for lowdimensional energy-dominated systems, to simulate slow dynamics in more general atomistic systems. We show that a few ...
93
Voted
CSC
2009
14 years 10 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...