Sciweavers

315 search results - page 12 / 63
» Simple Distributed Weighted Matchings
Sort
View
EMO
2001
Springer
125views Optimization» more  EMO 2001»
14 years 4 days ago
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
The conventional weighted aggregation method is extended to realize multi-objective optimization. The basic idea is that systematically changing the weights during evolution will l...
Yaochu Jin, Tatsuya Okabe, Bernhard Sendhoff
PODS
2011
ACM
238views Database» more  PODS 2011»
12 years 10 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
14 years 9 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
ATAL
2009
Springer
14 years 2 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 1 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking