Sciweavers

8337 search results - page 1203 / 1668
» Reasoning With Characteristic Models
Sort
View
152
Voted
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 7 months ago
For the sake of simplicity: Unsupervised extraction of lexical simplifications from Wikipedia
We report on work in progress on extracting lexical simplifications (e.g., "collaborate" "work together"), focusing on utilizing edit histories in Simple Engli...
Mark Yatskar, Bo Pang, Cristian Danescu-Niculescu-...
ECEASST
2008
60views more  ECEASST 2008»
15 years 7 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer
IANDC
2008
131views more  IANDC 2008»
15 years 7 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 6 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati
190
Voted
CORR
2006
Springer
112views Education» more  CORR 2006»
15 years 6 months ago
High-level synthesis under I/O Timing and Memory constraints
The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper...
Philippe Coussy, Gwenolé Corre, Pierre Bome...
« Prev « First page 1203 / 1668 Last » Next »