4940 search results - page 268 / 988 » On the Complexity of Universal Programs |
180
click to vote
WCET
2007
15 years 7 months ago
2007
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
205
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
182
click to vote
PVM
1997
Springer
15 years 10 months ago
1997
Springer
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
200
click to vote
GECCO
2008
Springer
2008
Springer
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
15 years 7 months ago
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...
221
click to vote
BMCBI
2002
15 years 6 months ago
2002
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...