835 search results - page 86 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
AMAI
2000
Springer
15 years 1 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
124
click to vote
TFS
2008
14 years 9 months ago
2008
Abstract--This study proposes an efficient self-evolving evolutionary learning algorithm (SEELA) for neurofuzzy inference systems (NFISs). The major feature of the proposed SEELA i...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...