Sciweavers

11051 search results - page 384 / 2211
» An Investigation of Generalized Cases
Sort
View
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 11 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...
CCCG
2010
15 years 9 months ago
Finding minimal bases in arbitrary spline spaces
In this work we describe a general algorithm to find a finite-element basis with minimum total support for an arbitrary spline space, given any basis for that same space. The runn...
Ana Paula Malheiro, Jorge Stolfi
AAAI
2004
15 years 9 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
EUSFLAT
2001
103views Fuzzy Logic» more  EUSFLAT 2001»
15 years 9 months ago
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters
A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determine...
Stefan Chanas, Adam Kasperski
CCE
2008
15 years 7 months ago
Differential recurrent neural network based predictive control
An efficient algorithm to train general differential recurrent neural networks is proposed. The trained network can be directly used as the internal model of a predictive controll...
R. K. Al Seyab, Yi Cao