1332 search results - page 37 / 267 » Combinatorial Algorithms |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
AUSAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
— We examine an abstract formulation of BIST diagnosis in digital logic systems. The BIST diagnosis problem has applications that include identification of erroneous test vector...
SIGECOM
2003
ACM
14 years 2 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...