1197 search results - page 51 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
ECAI
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
IJCAI
1989
13 years 10 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
CP
1998
Springer
14 years 1 months ago
1998
Springer
In this paper we will show how constraint solving methods can be applied for the recognition of buildings in aerial images. Object models are transformed to constraint representati...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...