Sciweavers

721 search results - page 81 / 145
» Almost universal graphs
Sort
View
PATAT
2000
Springer
124views Education» more  PATAT 2000»
14 years 1 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
NPL
2008
68views more  NPL 2008»
13 years 10 months ago
On Nonparametric Residual Variance Estimation
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
Elia Liitiäinen, Francesco Corona, Amaury Len...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 3 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 3 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
GD
2005
Springer
14 years 3 months ago
Network Analysis and Visualisation
A workshop on Network Analysis and Visualisation was held on September 11, 2005 in Limerick Ireland, in conjunction with 2005 Graph Drawing conference. This report review the backg...
Seok-Hee Hong