Sciweavers

789 search results - page 117 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 9 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
BMCBI
2008
115views more  BMCBI 2008»
13 years 8 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
DEXA
2004
Springer
136views Database» more  DEXA 2004»
14 years 2 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
AI
2003
Springer
14 years 2 months ago
Case Authoring from Text and Historical Experiences
The problem of repair and maintenance of complex systems, such as aircraft, cars and trucks is certainly a nontrivial task. Maintenance technicians must use a great amount of knowl...
Marvin Zaluski, Nathalie Japkowicz, Stan Matwin
FLAIRS
2008
13 years 11 months ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang