Sciweavers

3713 search results - page 239 / 743
» Constructing a Calculus of Programs
Sort
View
AAAI
1994
15 years 5 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
134
Voted
ET
2010
83views more  ET 2010»
15 years 2 months ago
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems
—Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. For the class of static affine program...
Sven Verdoolaege, Martin Palkovic, Maurice Bruynoo...
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
15 years 1 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy
128
Voted
CIS
2005
Springer
15 years 9 months ago
A Naive Statistics Method for Electronic Program Guide Recommendation System
Abstract. In this paper, we propose a naive statistics method for constructing a personalized recommendation system for the Electronic Program Guide (EPG). The idea is based on a p...
Jin An Xu, Kenji Araki
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 5 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura