4940 search results - page 368 / 988 » On the Complexity of Universal Programs |
205
click to vote
EC
1998
15 years 6 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
143
click to vote
AUIC
2006
IEEE
16 years 24 days ago
2006
IEEE
An execution trace contains a description of everything that happened during an execution of a program. Execution traces are useful, because they can help software engineers under...
184
click to vote
APLAS
2006
ACM
16 years 21 days ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
156
click to vote
AGP
2003
IEEE
16 years 1 days ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
162
click to vote
VISUALIZATION
2000
IEEE
15 years 11 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...