Sciweavers

835 search results - page 156 / 167
» Geometric Logic in Computer Science
Sort
View
KCAP
2003
ACM
14 years 1 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 8 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ICS
2005
Tsinghua U.
14 years 2 months ago
Low-power, low-complexity instruction issue using compiler assistance
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S...
EBERNBURG
1990
14 years 20 days ago
Problems of Autonomy and Discontexturality in the Theory of Living Systems
In the theory of living systems any description of self-organizing processes is confronted by a very central problem concerning the role of the system's boundary, i.e., there...
Rudolf Kaehr, E. von Goldammer