Sciweavers

364 search results - page 66 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
ICPP
2006
IEEE
15 years 3 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
MOBISYS
2009
ACM
15 years 10 months ago
BlueMonarch: a system for evaluating bluetooth applications in the wild
Despite Bluetooth's popularity, low cost, and low power requirements, Bluetooth applications remain remarkably unsophisticated. Although the research community and industry h...
Timothy J. Smith, Stefan Saroiu, Alec Wolman
IPPS
2008
IEEE
15 years 3 months ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
SPAA
2003
ACM
15 years 2 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
OL
2011
332views Neural Networks» more  OL 2011»
14 years 4 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski