Sciweavers

7820 search results - page 1168 / 1564
» Formalization of Time and Space
Sort
View
DAC
2007
ACM
16 years 7 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
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
16 years 3 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu
KDD
2009
ACM
181views Data Mining» more  KDD 2009»
16 years 1 months ago
An exploration of climate data using complex networks
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
Karsten Steinhaeuser, Nitesh V. Chawla, Auroop R. ...
EMSOFT
2009
Springer
16 years 1 months ago
Implementing time-predictable load and store operations
Scratchpads have been widely proposed as an alternative to caches for embedded systems. Advantages of scratchpads include reduced energy consumption in comparison to a cache and a...
Jack Whitham, Neil C. Audsley
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 1 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
« Prev « First page 1168 / 1564 Last » Next »