Sciweavers

200 search results - page 3 / 40
» A combinatorial approach to the power of 2 in the number of ...
Sort
View
AUSAI
2005
Springer
13 years 11 months ago
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
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...
Andrew Lim, Jiqing Tang
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 7 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
ISCAS
2007
IEEE
131views Hardware» more  ISCAS 2007»
14 years 16 days ago
2-MITE Product-of-Power-Law Networks
— A 2-MITE is a multiple-input translinear element with two input gates. In this paper, different properties of networks of 2-MITEs are derived, especially in the case of product...
Shyam Subramanian, David V. Anderson
IPPS
2008
IEEE
14 years 20 days ago
Towards a decentralized architecture for optimization
We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
Marco Biazzini, Mauro Brunato, Alberto Montresor
CG
2004
Springer
13 years 10 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li