Sciweavers

2944 search results - page 503 / 589
» On Well Quasi-orders on Languages
Sort
View
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 8 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
TSE
2010
140views more  TSE 2010»
13 years 8 months ago
Learning a Metric for Code Readability
—In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from 120 human annotators, we derive associations...
Raymond P. L. Buse, Westley Weimer
ACL
2010
13 years 7 months ago
Expanding Verb Coverage in Cyc with VerbNet
A robust dictionary of semantic frames is an essential element of natural language understanding systems that use ontologies. However, creating lexical resources that accurately c...
Clifton McFate
ATVA
2010
Springer
142views Hardware» more  ATVA 2010»
13 years 7 months ago
On Scenario Synchronization
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla
DOLAP
2010
ACM
13 years 7 months ago
Relational versus non-relational database systems for data warehousing
Relational database systems have been the dominating technology to manage and analyze large data warehouses. Moreover, the ER model, the standard in database design, has a close r...
Carlos Ordonez, Il-Yeol Song, Carlos Garcia-Alvara...