5263 search results - page 228 / 1053 » Open Constraint Optimization |
126
click to vote
AAAI
2000
15 years 5 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
130
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
128
click to vote
IEICET
2010
15 years 2 months ago
2010
—To recover texture images from impulse noise by the opening operation which is one of morphological operations, an suitable structuring element (SE) has to be estimated. Hithert...
180
click to vote
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
119
click to vote
AAAI
2008
15 years 6 months ago
2008
One way for agents to reach a joint decision is to vote over the alternatives. In open, anonymous settings such as the Internet, an agent can vote more than once without being det...