A note on alternating sums.
Kirschenhofer, Peter (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kirschenhofer, Peter (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Prodinger, Helmut (1993)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Martínez, Conrado, Panholzer, Alois, Prodinger, Helmut (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, Wei-Mei, Hwang, Hsien-Kuei, Tsai, Tsung-Hsi (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Breimer, Eric, Goldberg, Mark, Kolstad, Brian, Magdon-Ismail, Malik (2001)
Experimental Mathematics
Similarity:
Cameron, Peter J., Johannsen, Daniel, Prellberg, Thomas, Schweitzer, Pascal (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Ivan Kramosil (1990)
Kybernetika
Similarity:
Dorin Bocu (2000)
The Yugoslav Journal of Operations Research
Similarity:
Cédric Pralet, Gérard Verfaillie (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The decision repair algorithm (Jussien and Lhomme, Artificial Intelligence 139 (2002) 21–45), which has been designed to solve constraint satisfaction problems (CSP), can be seen, either (i) as an extension of the classical depth first tree search algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a local search algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between...
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity: