Sciweavers

88 search results - page 2 / 18
» Backtracking Algorithms and Search Heuristics to Generate Te...
Sort
View
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
13 years 9 months ago
Towards a universal test suite for combinatorial auction algorithms
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
JAL
2008
139views more  JAL 2008»
13 years 4 months ago
A test suite for the evaluation of mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application...
Meritxell Vinyals, Andrea Giovannucci, Jesú...
CP
2006
Springer
13 years 8 months ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
IASTEDSE
2004
13 years 6 months ago
A deterministic density algorithm for pairwise interaction coverage
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according ...
Charles J. Colbourn, Myra B. Cohen, Renée T...
KBSE
2005
IEEE
13 years 10 months ago
Constructing interaction test suites with greedy algorithms
Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test...
Renée C. Bryce, Charles J. Colbourn