779 search results - page 109 / 156 » Algorithms for the Sample Mean of Graphs |
184
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
172
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
136
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
182
click to vote
CLA
2007
15 years 5 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
161
click to vote
AIPS
2010
15 years 5 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...