Sciweavers

366 search results - page 35 / 74
» Self-Organizing Multiagent Approach to Optimization in Posit...
Sort
View
109
Voted
ATAL
2003
Springer
15 years 9 months ago
Walverine: a Walrasian trading agent
TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation m...
Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevi...
131
Voted
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 7 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
145
Voted
AAAI
2010
15 years 5 months ago
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
Mingyu Guo, Vincent Conitzer
144
Voted
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 7 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ICCD
1997
IEEE
100views Hardware» more  ICCD 1997»
15 years 8 months ago
Optimal Clock Period Clustering for Sequential Circuits with Retiming
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
Arvind K. Karandikar, Peichen Pan, C. L. Liu