6562 search results - page 137 / 1313 » Noetherianity and Combination Problems |
151
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
170
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
153
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
135
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
177
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...