4488 search results - page 439 / 898 » Focusing Search by Using Problem Solving Experience |
147
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
144
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
183
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Service discovery and matchmaking in a distributed environment has been an active research issue since at least the mid 1990s. Previous work on matchmaking has typically presented...
130
click to vote
IJCAI
2001
15 years 7 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
179
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...