Sciweavers

4377 search results - page 737 / 876
» Mass problems and randomness
Sort
View
AAAI
2004
14 years 11 months ago
Additive versus Multiplicative Clause Weighting for SAT
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...
FCS
2006
14 years 11 months ago
Principles of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
BNCOD
2003
104views Database» more  BNCOD 2003»
14 years 11 months ago
External Sorting with On-the-Fly Compression
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
John Yiannis, Justin Zobel
ICWS
2004
IEEE
14 years 11 months ago
Large Scale, Type-Compatible Service Composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
ISCAPDCS
2004
14 years 11 months ago
R-Chain: A Self-Maintained Reputation Management System in P2P Networks
Trust management is a critical component in P2P file sharing systems due to the free riding and security problem. In this paper, we propose a lightweight reputation management sys...
Lintao Liu, Shu Zhang, Kyung Dong Ryu, Partha Dasg...