Sciweavers

10901 search results - page 415 / 2181
» Approximations in Distributed Optimization
Sort
View
193
Voted
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
16 years 12 days ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
ATAL
2008
Springer
15 years 9 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
216
Voted
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 7 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
166
Voted
ISCAS
2008
IEEE
112views Hardware» more  ISCAS 2008»
16 years 2 months ago
Power optimization of weighted bit-product summation tree for elementary function generator
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
Saeeid Tahmasbi Oskuii, Kenny Johansson, Oscar Gus...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
16 years 1 months ago
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
Arnaud Soulet, Bruno Crémilleux