Sciweavers

1559 search results - page 197 / 312
» Some Group Theory Problems
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 8 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
IWC
2011
111views more  IWC 2011»
14 years 5 months ago
Socio-technical systems: From design methods to systems engineering
The importance of adopting a socio-technical approach to system development is recognised by many but not widely practised. We analyse the reasons for this, considering the histor...
Gordon D. Baxter, Ian Sommerville
WWW
2005
ACM
15 years 10 months ago
Information search and re-access strategies of experienced web users
Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines. We studied how prevalent these strate...
Anne Aula, Mika Käki, Natalie Jhaveri
MIR
2003
ACM
213views Multimedia» more  MIR 2003»
15 years 3 months ago
Replication algorithms to retrieve scalable streaming media over Content Delivery Networks
CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an ...
Zhou Su, Jiro Katto, Yasuhiko Yasuda
JCT
2006
100views more  JCT 2006»
14 years 10 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela