Sciweavers

19320 search results - page 49 / 3864
» On the complexity of computing determinants
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 10 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
DSN
2000
IEEE
15 years 11 months ago
Exploiting Non-Determinism for Reliability of Mobile Agent Systems
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable mobile agent system is especially challenging since...
Ajay Mohindra, Apratim Purakayastha, Prasannaa Tha...
KDD
1995
ACM
130views Data Mining» more  KDD 1995»
15 years 10 months ago
Compression-Based Evaluation of Partial Determinations
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
Bernhard Pfahringer, Stefan Kramer
AAAI
2008
15 years 8 months ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer
BIBE
2004
IEEE
15 years 10 months ago
Identifying the Combination of Genetic Factors that Determine Susceptibility to Cervical Cancer
Cervical cancer is common among women all over the world. Although infection with high-risk types of human papillomavirus (HPV) has been identified as the primary cause of cervical...
Jorng-Tzong Horng, Kai-Chih Hu, Li-Cheng Wu, Hsien...