Sciweavers

861 search results - page 154 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
14 years 27 days ago
From Computer Networks to Agent Networks
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
Guoqiang Zhong, Kenichi Takahashi, Satoshi Amamiya...
CASES
2003
ACM
14 years 26 days ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
FPL
2003
Springer
259views Hardware» more  FPL 2003»
14 years 24 days ago
Branch Optimisation Techniques for Hardware Compilation
Abstract. This paper explores using information about program branch probabilities to optimise reconfigurable designs. The basic premise is to promote utilization by dedicating mo...
Henry Styles, Wayne Luk
IEAAIE
1999
Springer
13 years 12 months ago
Modelling Fuzzy Sets Using Object-Oriented Techniques
This paper describes a new approach to model fuzzy sets using object-oriented programming techniques. Currently, the most frequently used method to model fuzzy sets is by using a p...
Gary Yat Chung Wong, Hon Wai Chun
CP
1997
Springer
13 years 11 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...