Sciweavers

2983 search results - page 17 / 597
» The group marriage problem
Sort
View
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 5 hour ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
CHI
2009
ACM
14 years 5 days ago
The people-prototype problem: understanding the interaction between prototype format and user group
When gathering feedback about an envisioned system, prototypes communicate design ideas to user groups. However, it is unclear how user responses are affected by prototype format....
Katherine M. Sellen, Micheal Massimi, Danielle M. ...
DM
2000
89views more  DM 2000»
13 years 7 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
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
ASIACRYPT
2008
Springer
13 years 9 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...