1554 search results - page 55 / 311 » Parameterized Complexity and Approximation Algorithms |
135
Voted
SG
2005
Springer
15 years 8 months ago
2005
Springer
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
177
Voted
JMLR
2010
14 years 9 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
116
Voted
HICSS
2002
IEEE
15 years 7 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
120
Voted
WG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
121
Voted
GMP
2006
IEEE
15 years 8 months ago
2006
IEEE
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...