Sciweavers

4372 search results - page 531 / 875
» Algorithmic Theories of Everything
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Towards an evolutionary tool for the allocation of supermarket shelf space
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
15 years 10 months ago
The parallel Nash Memory for asymmetric games
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function...
Frans A. Oliehoek, Edwin D. de Jong, Nikos A. Vlas...
ESOP
2000
Springer
15 years 10 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
CVPR
2009
IEEE
15 years 10 months ago
Nonlinear Nonnegative Component Analysis
In this paper general solutions for Nonlinear Nonnegative Component Analysis for data representation and recognition are proposed. That is, motivated by a combination of the Nonne...
Stefanos Zafeiriou, Maria Petrou