1686 search results - page 189 / 338 » Programs as polygraphs: computability and complexity |
117
Voted
SIGGRAPH
1987
ACM
15 years 7 months ago
1987
ACM
The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rar...
127
click to vote
WSC
2001
15 years 5 months ago
2001
Simulation beginners often spend a great amount of time to accumulate the knowledge as well as the experience to overcome the technical complexity of computer simulation. Limited ...
159
Voted
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
145
click to vote
COMPGEOM
2010
ACM
15 years 9 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...
100
click to vote
IFIP
1994
Springer
15 years 8 months ago
1994
Springer
Development of a research project in Computer Science, integrating a considerable number of research institutions and about 1200 individual researchers all over a country with big...