157 search results - page 30 / 32 » Frugal Colouring of Graphs |
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
AIME
2003
Springer
13 years 10 months ago
2003
Springer
Ambulatory care supporting long-term treatment of type I diabetes mellitus (DM) is based on the analysis of daily notes of serum glucose measurements, carbohydrate intake, and insu...
HAIS
2009
Springer
13 years 10 months ago
2009
Springer
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...
LICS
1997
IEEE
13 years 8 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
VISSYM
2007
13 years 7 months ago
2007
Lattice graphs are used as underlying data structures in many statistical processing systems, including natural language processing. Lattices compactly represent multiple possible...