Sciweavers

853 search results - page 94 / 171
» Team Learning of Computable Languages
Sort
View
FMSD
2008
110views more  FMSD 2008»
13 years 10 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ICALP
2004
Springer
14 years 3 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
14 years 1 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
ACL
2004
13 years 11 months ago
Applying Machine Learning to Chinese Temporal Relation Resolution
Temporal relation resolution involves extraction of temporal information explicitly or implicitly embedded in a language. This information is often inferred from a variety of inte...
Wenjie Li, Kam-Fai Wong, Guihong Cao, Chunfa Yuan
ACMIDC
2008
14 years 22 hour ago
Tangible programming and informal science learning: making TUIs work for museums
In this paper we describe the design and initial evaluation of a tangible computer programming exhibit for children on display at the Boston Museum of Science. We also discuss fiv...
Michael S. Horn, Erin Treacy Solovey, Robert J. K....