1977 search results - page 16 / 396 » The satisfactory partition problem |
151
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
150
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
170
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
149
click to vote
IDA
2008
Springer
15 years 5 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
133
click to vote
ICPR
2002
IEEE
16 years 6 months ago
2002
IEEE
We provide elementary geometric arguments to show that the principal point of cameras with small to moderate field of view cannot be reliably estimated from natural, noisy images ...