10988 search results - page 511 / 2198 » Algorithmic Folding Complexity |
189
click to vote
DCOSS
2005
Springer
16 years 17 days ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
170
click to vote
GECCO
2005
Springer
16 years 17 days ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
146
Voted
GECCO
2005
Springer
16 years 17 days ago
2005
Springer
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
180
Voted
GECCO
2005
Springer
16 years 17 days ago
2005
Springer
Mobile ad hoc networks are typically designed and evaluated in generic simulation environments. However the real conditions in which these networks are deployed can be quite diff...
188
click to vote
ROBOCUP
2005
Springer
16 years 16 days ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...