12519 search results - page 298 / 2504 » Approximation Problems Categories |
234
click to vote
SMC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
214
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
136
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We analyze a simple, Bellman-error-based approach to generating basis functions for valuefunction approximation. We show that it generates orthogonal basis functions that provably...
165
click to vote
ADBIS
2007
Springer
16 years 25 days ago
2007
Springer
Functional dependencies (FDs) are an integral part of database theory since they are used in integrity enforcement and in database design. Recently, functional dependencies satisï¬...
191
click to vote
ECCC
2010
15 years 6 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...