Sciweavers

3059 search results - page 193 / 612
» with Wide Functional Units
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
15 years 6 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
JSS
2006
134views more  JSS 2006»
15 years 6 months ago
An agent based synchronization scheme for multimedia applications
Synchronization of multimedia streams is one of the important issue in multimedia communications. In this paper, we propose an adaptive synchronization agency for synchronization ...
Sunilkumar S. Manvi, P. Venkataram
AEI
2004
78views more  AEI 2004»
15 years 6 months ago
Use of design patterns in analogy-based design
atterns specify generic relations among abstract design elements. We hypothesize that design patterns are productive units of analogical transfer in design. We describe a normativ...
Ashok K. Goel, Sambasiva R. Bhatta
IJUFKS
2000
65views more  IJUFKS 2000»
15 years 6 months ago
Some Group Theoretic Aspects of t-Norms
Continuous archimedean t-norms are generated by automorphisms f of ([0; 1]; ), the unit interval with its usual order structure. Such strict t-norms 4 are given by x 4 y = f 1 (f(...
Fred Richman, Elbert A. Walker
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
15 years 6 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...