Sciweavers

1350 search results - page 160 / 270
» Generalized Committed Choice
Sort
View
CPAIOR
2009
Springer
15 years 11 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
NOSSDAV
2009
Springer
15 years 10 months ago
A delaunay triangulation architecture supporting churn and user mobility in MMVEs
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmoha...
120
Voted
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
15 years 10 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
TAMC
2009
Springer
15 years 10 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens