Sciweavers

1302 search results - page 110 / 261
» Fair Equivalence Relations
Sort
View
186
Voted
CADE
2007
Springer
16 years 6 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
152
Voted
STACS
2010
Springer
16 years 24 days ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
DAC
1994
ACM
15 years 10 months ago
Automatic Verification of Pipelined Microprocessors
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
Vishal Bhagwati, Srinivas Devadas
JSW
2008
113views more  JSW 2008»
15 years 5 months ago
Semantic Information Retrieval Based on Fuzzy Ontology for Electronic Commerce
Information retrieval is the important work for Electronic Commerce. Ontology-based semantic retrieval is a hotspot of current research. In order to achieve fuzzy semantic retrieva...
Jun Zhai, Yiduo Liang, Yi Yu, Jiatao Jiang
OTM
2009
Springer
16 years 11 days ago
Semantic Event Correlation Using Ontologies
Complex event processing (CEP) is a software architecture paradigm that aims at low latency, high throughput, and quick adaptability of applications for supporting and improving ev...
Thomas Moser, Heinz Roth, Szabolcs Rozsnyai, Richa...