4940 search results - page 609 / 988 » On the Complexity of Universal Programs |
159
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
189
click to vote
AAAI
2007
15 years 9 months ago
2007
Analysis of postgenomic biological data (such as microarray and SNP data) is a subtle art and science, and the statistical methods most commonly utilized sometimes prove inadequat...
185
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
192
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Software systems are becoming more and more complex with a large number of interacting partners often distributed over a network. A common dilemma faced by software engineers in b...
168
click to vote
ICWS
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...