Sciweavers

8094 search results - page 271 / 1619
» Improvements in Formula Generalization
Sort
View
JAR
2008
77views more  JAR 2008»
15 years 24 days ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
109
Voted
TCS
2008
15 years 22 days ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
84
Voted
WIOPT
2010
IEEE
14 years 11 months ago
On the use of packet scheduling in self-optimization processes: Application to coverage-capacity optimization
—Self-organizing networks (SON) is commonly seen as a way to increase network performance while simplifying its management. This paper investigates Packet Scheduling (PS) in the ...
Richard Combes, Zwi Altman, Eitan Altman
90
Voted
EMNLP
2009
14 years 10 months ago
Learning Term-weighting Functions for Similarity Measures
Measuring the similarity between two texts is a fundamental problem in many NLP and IR applications. Among the existing approaches, the cosine measure of the term vectors represen...
Wen-tau Yih
TPDS
2002
80views more  TPDS 2002»
15 years 14 days ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...