2138 search results - page 305 / 428 » Logical Step-Indexed Logical Relations |
165
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
169
click to vote
SIGARCH
2008
15 years 6 months ago
2008
While technology trends have ushered in the age of chip multiprocessors (CMP) and enabled designers to place an increasing number of cores on chip, a fundamental question is what ...
404
click to vote
Book
"Spatial structures and spatial reasoning are essential to perception and cognition. Much
day-to-day practical information is about what happens at certain spatial locations....
265
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not nec...
178
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...