Sciweavers

3122 search results - page 383 / 625
» A Theory of Network Equivalence
Sort
View
188
Voted
SPAA
2006
ACM
16 years 25 days ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
192
Voted
SIGCOMM
2004
ACM
16 years 9 days ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
164
Voted
PODC
2009
ACM
16 years 7 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
211
Voted
IWANN
2009
Springer
16 years 1 months ago
Fuzzy Logic, Soft Computing, and Applications
We survey on the theoretical and practical developments of the theory of fuzzy logic and soft computing. Specifically, we briefly review the history and main milestones of fuzzy ...
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Acieg...
192
Voted
KER
2008
193views more  KER 2008»
15 years 6 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss