911 search results - page 159 / 183 » Kolmogorov Complexity Cores |
130
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
122
click to vote
VEE
2009
ACM
15 years 8 months ago
2009
ACM
r of high-level languages lies in their abstraction over hardware and software complexity, leading to greater security, better reliability, and lower development costs. However, o...
136
click to vote
CCS
2009
ACM
15 years 8 months ago
2009
ACM
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
133
click to vote
FPGA
2009
ACM
15 years 8 months ago
2009
ACM
Modern Field Programmable Gate Arrays (FPGAs) are capable of performing complex discrete signal processing algorithms with clock rates above 100MHz. This combined with FPGA’s lo...
119
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...