Sciweavers

84 search results - page 3 / 17
» A Many Permutation Group Result for Unstable Theories
Sort
View
JCT
2010
112views more  JCT 2010»
13 years 6 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
AAAI
2004
13 years 9 months ago
Implementing a Generalized Version of Resolution
We have recently proposed augmenting clauses in a Boolean database with groups of permutations, the augmented clauses then standing for the set of all clauses constructed by actin...
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofe...
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
13 years 8 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
HICSS
2006
IEEE
109views Biometrics» more  HICSS 2006»
14 years 1 months ago
Towards Using Technological Support of Group Memory in Problem-Solving Situations to Improve Self- and Collective Efficacy
Bandura’s theories of self- and collective efficacy are widely recognized in many fields, including psychology and management, but have been largely unnoticed by the Human-Compu...
Christopher Paul Middup, Peter Johnson
ATAL
2005
Springer
14 years 1 months ago
Towards a theory of "local to global" in distributed multi-agent systems (I)
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
Daniel Yamins