Sciweavers

4335 search results - page 367 / 867
» Privatizing Constraint Optimization
Sort
View
170
Voted
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
15 years 10 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
15 years 9 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...
ECML
2006
Springer
15 years 8 months ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi
ATAL
2008
Springer
15 years 7 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 6 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte