Sciweavers

2031 search results - page 306 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
ESANN
2004
13 years 9 months ago
Neural dynamics for task-oriented grouping of communicating agents
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
Jochen J. Steil
ML
2006
ACM
13 years 8 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
STACS
2001
Springer
14 years 17 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
STACS
2007
Springer
14 years 2 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler