172
click to vote
COCOA
16 years 5 days ago
2009 Springer 
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
167
click to vote
COCOA
15 years 9 months ago
2009 Springer 
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
162
click to vote
COCOA
16 years 5 days ago
2009 Springer 
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
188
click to vote
COCOA
16 years 5 days ago
2009 Springer 
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
135
Voted
COCOA
15 years 9 months ago
2009 Springer 
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
|
Discrete Geometry