Sciweavers

7773 search results - page 1334 / 1555
» On generalized Frame-Stewart numbers
Sort
View
166
Voted
CVIU
2008
109views more  CVIU 2008»
15 years 6 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
173
Voted
DAM
2008
84views more  DAM 2008»
15 years 6 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti
EOR
2010
119views more  EOR 2010»
15 years 6 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
ENTCS
2008
95views more  ENTCS 2008»
15 years 6 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
EOR
2008
78views more  EOR 2008»
15 years 6 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
« Prev « First page 1334 / 1555 Last » Next »