Sciweavers

14386 search results - page 297 / 2878
» The Chinese Generals Problem
Sort
View
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 6 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
ANOR
2004
68views more  ANOR 2004»
15 years 4 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
DESRIST
2009
Springer
102views Education» more  DESRIST 2009»
15 years 9 months ago
Design science as nested problem solving
Design science emphasizes the connection between knowledge and practice by showing that we can produce scientific knowledge by designing useful things. However, without further g...
Roel Wieringa
PATAT
2000
Springer
89views Education» more  PATAT 2000»
15 years 8 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
150
Voted
COR
2007
108views more  COR 2007»
15 years 5 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian