24421 search results - page 4450 / 4885 » Communicating Complex Systems |
129
click to vote
OPODIS
2004
15 years 7 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
159
click to vote
NIPS
2001
15 years 7 months ago
2001
Probabilistic mixture models are used for a broad range of data analysis tasks such as clustering, classification, predictive modeling, etc. Due to their inherent probabilistic na...
135
Voted
PICS
2001
15 years 7 months ago
2001
Banding can be a major defect in inkjet printing. Knowing the visual sensitivity threshold of inkjet banding is therefore useful for understanding and pushing the technological li...
152
click to vote
ICAI
2003
15 years 7 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
205
click to vote
RIAO
2004
15 years 7 months ago
2004
This paper introduces a new approach to provide users with solutions to explore a domain via an information space. A key point in our approach is that information searching and ex...