Sciweavers

725 search results - page 47 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
COORDINATION
2004
Springer
15 years 3 months ago
CoorSet: A Development Environment for Associatively Coordinated Components
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
Kevin Kane, James C. Browne
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 10 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 10 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
92
Voted
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 9 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 1 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...