Sciweavers

13603 search results - page 226 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
PUC
2002
80views more  PUC 2002»
15 years 6 months ago
Overcoming the Lack of Screen Space on Mobile Computers
One difficulty for interface design on mobile computers is lack of screen space caused by their small size. This paper describes a small pilot study and two formal experiments tha...
Stephen A. Brewster
180
Voted
IJFCS
2010
92views more  IJFCS 2010»
15 years 4 months ago
Collapsing the Hierarchy of Parallel Computational Models
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature,...
Stefan D. Bruda, Yuanqiao Zhang
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
15 years 11 months ago
Improved Effective Capacitance Computations for Use in Logic and Layout Optimization
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...
Andrew B. Kahng, Sudhakar Muddu
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 10 months ago
New efficient algorithms for computing effective capacitance
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
Andrew B. Kahng, Sudhakar Muddu
208
Voted
DALT
2009
Springer
15 years 10 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...