Sciweavers

235 search results - page 6 / 47
» Average-case complexity and decision problems in group theor...
Sort
View
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 7 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
MATES
2009
Springer
14 years 2 months ago
Towards a Taxonomy of Decision Making Problems in Multi-Agent Systems
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...
Christian Guttmann
IJAMC
2008
99views more  IJAMC 2008»
13 years 7 months ago
Improving Educational Multimedia selection process using group decision support systems
Educational Multimedia (EMM) is becoming a mature and integral part of teaching and learning systems, mainly due to its ability improve teaching and learning. However, EMM selecti...
Mohammed N. A. Abdelhakim, Shervin Shirmohammadi
IAT
2005
IEEE
14 years 1 months ago
Complexity of a theory of collective attitudes in teamwork
Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individua...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger