Sciweavers

5331 search results - page 952 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 1 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
HIS
2007
13 years 11 months ago
Pareto-based Multi-Objective Machine Learning
—Machine learning is inherently a multiobjective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggreg...
Yaochu Jin
IJCAI
2003
13 years 11 months ago
A Planning Algorithm for Predictive State Representations
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
Masoumeh T. Izadi, Doina Precup
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 10 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen