696 search results - page 97 / 140 » A class of combinatorial identities |
183
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
163
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
170
click to vote
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
140
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
186
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...