Sciweavers

489 search results - page 38 / 98
» Support tools for graphs in computer science
Sort
View
PODC
2012
ACM
13 years 3 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
MFCS
2005
Springer
15 years 6 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
IWCMC
2006
ACM
15 years 7 months ago
What does using TCP as an evaluation tool reveal about MANET routing protocols?
Past research studying the operations of TCP over wireless/mobile ad hoc networks has shown that TCP cannot be adopted as-is for use in mobile ad hoc networks (MANET) to achieve r...
Sundaram Rajagopalan, Chien-Chung Shen
HICSS
2009
IEEE
145views Biometrics» more  HICSS 2009»
15 years 8 months ago
Automatic Web Services Generation
This paper discusses the design and implementation of a Service Generator Toolkit (SGT) that allows web services researchers to easily create large numbers of web services. When d...
Ernest Cho, Sam Chung, Daniel Zimmerman
SIGOPS
2010
162views more  SIGOPS 2010»
14 years 11 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig