Sciweavers

589 search results - page 107 / 118
» Introducing Dynamic Constraints in B
Sort
View
TOG
2002
107views more  TOG 2002»
13 years 7 months ago
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displ...
Benjamin B. Bederson, Ben Shneiderman, Martin Watt...
DAC
2007
ACM
14 years 9 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu
ISCC
2009
IEEE
198views Communications» more  ISCC 2009»
14 years 2 months ago
An analysis of the heterogeneity and IP packet reordering over multiple wireless networks
Abstract—With the increasing deployment of wireless technologies, such as WLAN, HSDPA, and WiMAX, it is often the case that simultaneous coverage of several access networks is av...
Dominik Kaspar, Kristian Evensen, Audun Fosselie H...
CODES
2008
IEEE
13 years 9 months ago
Application specific non-volatile primary memory for embedded systems
Memory subsystems have been considered as one of the most critical components in embedded systems and furthermore, displaying increasing complexity as application requirements div...
Kwangyoon Lee, Alex Orailoglu
IJCAI
1997
13 years 9 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter