3179 search results - page 270 / 636 » Applications of PCF Theory |
DAC
2005
ACM
16 years 1 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
109
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
81
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
94
Voted
CHI
2004
ACM
16 years 1 months ago
2004
ACM
We present a method for performing selection tasks based on continuous control of multiple, competing agents who try to determine the user's intentions from their control beh...
214
Voted
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...