947 search results - page 135 / 190 » Discrete Geometry |
CIE
2005
Springer
15 years 3 months ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...