Sciweavers

696 search results - page 36 / 140
» A class of combinatorial identities
Sort
View
CDC
2009
IEEE
165views Control Systems» more  CDC 2009»
15 years 6 months ago
Achieving symmetric Pareto Nash equilibria using biased replicator dynamics
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
Kiran Somasundaram, John S. Baras
ACL
2008
15 years 3 months ago
A Logical Basis for the D Combinator and Normal Form in CCG
The standard set of rules defined in Combinatory Categorial Grammar (CCG) fails to provide satisfactory analyses for a number of syntactic structures found in natural languages. T...
Frederick Hoyt, Jason Baldridge
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
15 years 3 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
15 years 2 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
15 years 2 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan