1055 search results - page 42 / 211 » Enumerations in computable structure theory |
EP
1998
Springer
15 years 1 months ago
1998
Springer
This article presents mathematical tools for computer-generated ornamental patterns, with a particular attention payed to Islamic patterns. The article shows how, starting from a p...
SIGACT
2008
14 years 9 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
LICS
1996
IEEE
15 years 1 months ago
1996
IEEE
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
INFSOF
2006
14 years 9 months ago
2006
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...