Sciweavers

358 search results - page 21 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
COMPGEOM
2003
ACM
15 years 7 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
JPDC
2007
92views more  JPDC 2007»
15 years 1 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
IPPS
2009
IEEE
15 years 8 months ago
A metascalable computing framework for large spatiotemporal-scale atomistic simulations
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
Ken-ichi Nomura, Richard Seymour, Weiqiang Wang, H...
IPSN
2005
Springer
15 years 7 months ago
Matched source-channel communication for field estimation in wireless sensor networks
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
Waheed Uz Zaman Bajwa, Akbar M. Sayeed, Robert D. ...
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 2 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg