Sciweavers

1984 search results - page 35 / 397
» The colourful feasibility problem
Sort
View
ICWN
2003
13 years 11 months ago
Modeling and Evaluation of Scatternets Performance by Using Petri Nets
Coloured Petri Nets are powerful models for different problems. This paper deals with the modelling of a Bluetooth communication network, piconet and scatternet. The developed Pet...
Silke Feldmann, Tim Hartmann, Kyandoghere Kyamakya
ACISICIS
2007
IEEE
14 years 4 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
HUMO
2007
Springer
14 years 4 months ago
3D Hand Tracking in a Stochastic Approximation Setting
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
Desmond Chik, Jochen Trumpf, Nicol N. Schraudolph
ANOR
2004
68views more  ANOR 2004»
13 years 9 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
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