4940 search results - page 636 / 988 » On the Complexity of Universal Programs |
191
click to vote
ASPLOS
1991
ACM
15 years 10 months ago
1991
ACM
The memory consistency model supported by a multiprocessor architecture determines the amount of buffering and pipelining that may be used to hide or reduce the latency of memory ...
222
click to vote
GPCE
2009
Springer
15 years 10 months ago
2009
Springer
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
181
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
242
click to vote
APBC
2004
15 years 8 months ago
2004
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...
194
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...