Sciweavers

1064 search results - page 144 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
15 years 9 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
ICDM
2009
IEEE
184views Data Mining» more  ICDM 2009»
15 years 1 months ago
Improved Multi Label Classification in Hierarchical Taxonomies
Hierarchical taxonomies are used to organize and retrieve information in many domains, especially those dealing with large and rapidly growing amounts of information. In many of t...
Kunal Punera, Suju Rajan
140
Voted
AAAI
2010
15 years 5 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
130
Voted
FUIN
2010
143views more  FUIN 2010»
15 years 1 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer