Sciweavers

3367 search results - page 45 / 674
» Incremental assignment problem
Sort
View
IPCO
2004
114views Optimization» more  IPCO 2004»
14 years 11 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
PPSN
2004
Springer
15 years 3 months ago
Credit Assignment Among Neurons in Co-evolving Populations
Different credit assignment strategies are investigated in a two level co-evolutionary model which involves a population of Gaussian neurons and a population of radial basis funct...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff
GECCO
2004
Springer
111views Optimization» more  GECCO 2004»
15 years 3 months ago
Cooperative Problem Solving Using an Agent-Based Market
A key problem in multi-agent systems research is identifying appropriate techniques to facilitate effective cooperation between agents. In this paper, we investigate the efficacy o...
David Cornforth, Michael Kirley
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
15 years 3 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand