Sciweavers

498 search results - page 69 / 100
» Experimental comparison of the two Fredman-Khachiyan-algorit...
Sort
View
AAAI
2007
15 years 3 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
ATAL
2008
Springer
15 years 3 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
ADMA
2005
Springer
202views Data Mining» more  ADMA 2005»
15 years 3 months ago
A Latent Usage Approach for Clustering Web Transaction and Building User Profile
Web transaction data between web visitors and web functionalities usually convey users’ task-oriented behavior patterns. Clustering web transactions, thus, may capture such infor...
Yanchun Zhang, Guandong Xu, Xiaofang Zhou
ESEM
2008
ACM
15 years 3 months ago
On establishing a benchmark for evaluating static analysis alert prioritization and classification techniques
Benchmarks provide an experimental basis for evaluating software engineering processes or techniques in an objective and repeatable manner. We present the FAULTBENCH v0.1 benchmar...
Sarah Smith Heckman, Laurie Williams
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 2 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee