976 search results - page 52 / 196 » The Complexity of Timetable Construction Problems |
DAGSTUHL
2006
13 years 10 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
DAGSTUHL
2003
13 years 10 months ago
2003
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
SYRCODIS
2007
13 years 10 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
OPODIS
2001
13 years 10 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...