4894 search results - page 266 / 979 » The Guarding Problem - Complexity and Approximation |
177
click to vote
ICDM
2007
IEEE
16 years 28 days ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
155
click to vote
ICRA
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
155
click to vote
ZUM
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
150
click to vote
FMCAD
2004
Springer
16 years 3 hour ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
177
click to vote
GECCO
2004
Springer
16 years 47 min ago
2004
Springer
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...