Sciweavers

3422 search results - page 623 / 685
» Random Subset Optimization
Sort
View
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 2 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
CI
2004
116views more  CI 2004»
15 years 2 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
15 years 2 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 2 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
129
Voted
CORR
2002
Springer
159views Education» more  CORR 2002»
15 years 2 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm