Sciweavers

83 search results - page 7 / 17
» Exact methods for combinatorial auctions
Sort
View
COMPSAC
2006
IEEE
14 years 1 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang
ACG
2006
Springer
14 years 1 months ago
Solving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
Ling Zhao, Martin Müller 0003
ATAL
2010
Springer
13 years 8 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
ANTSW
2006
Springer
13 years 11 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
LICS
2010
IEEE
13 years 6 months ago
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
Vincent Danos, Jérôme Feret, Walter F...