Sciweavers

7129 search results - page 223 / 1426
» Approximation Algorithms for Treewidth
Sort
View
AAAI
2004
15 years 5 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann
136
Voted
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 3 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
ICDAR
2009
IEEE
15 years 1 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
COMPGEOM
2001
ACM
15 years 7 months ago
A practical approach for computing the diameter of a point set
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Sariel Har-Peled
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 5 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
Anupam Gupta