1480 search results - page 176 / 296 » Ants can solve constraint satisfaction problems |
186
click to vote
IJCAI
1989
15 years 7 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
164
click to vote
AIPS
2010
15 years 9 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
183
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
178
click to vote
HICSS
2000
IEEE
15 years 11 months ago
2000
IEEE
As knowledge becomes the primary focus of work in many industries, virtual communities and groups are emerging as part of new organizational forms. Within these virtual forms, eff...
156
click to vote
ICTAI
2007
IEEE
16 years 26 days ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...