Sciweavers

534 search results - page 100 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
FOCS
2004
IEEE
14 years 15 days ago
No Sorting? Better Searching!
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
Gianni Franceschini, Roberto Grossi
CN
2008
108views more  CN 2008»
13 years 8 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
CORR
2010
Springer
49views Education» more  CORR 2010»
13 years 8 months ago
Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
Animashree Anandkumar, Nithin Michael, Ao Kevin Ta...
IPPS
2009
IEEE
14 years 3 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
SPAA
2005
ACM
14 years 2 months ago
Finding effective support-tree preconditioners
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ra...