Sciweavers

3172 search results - page 406 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
BMCBI
2005
119views more  BMCBI 2005»
15 years 6 months ago
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a q...
Daron M. Standley, Hiroyuki Toh, Haruki Nakamura
175
Voted
HPDC
1998
IEEE
15 years 11 months ago
Metascheduling: A Scheduling Model for Metacomputing Systems
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
Jon B. Weissman
LPNMR
1997
Springer
15 years 10 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
PODC
2009
ACM
16 years 7 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
ECCC
2007
147views more  ECCC 2007»
15 years 6 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...