Sciweavers

109 search results - page 15 / 22
» General Symmetry Breaking Constraints
Sort
View
PODC
2011
ACM
14 years 4 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
MOBIHOC
2010
ACM
14 years 11 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
CONSTRAINTS
2011
14 years 8 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
FOCS
2009
IEEE
15 years 8 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
ICRA
2005
IEEE
127views Robotics» more  ICRA 2005»
15 years 7 months ago
Operational Space Control of Multibody Systems with Explicit Holonomic Constraints
— This paper presents an operational space control approach for the general class of holonomically constrained multibody systems. As a point of departure, the general formulation...
Vincent De Sapio, Oussama Khatib