Sciweavers

2107 search results - page 11 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
13 years 12 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
SRDS
2010
IEEE
13 years 5 months ago
A Cooperative Sampling Approach to Discovering Optimal Configurations in Large Scale Computing Systems
With the growing scale of current computing systems, traditional configuration tuning methods become less effective because they usually assume a small number of parameters in the...
Haifeng Chen, Guofei Jiang, Hui Zhang 0002, Kenji ...
CORR
2011
Springer
142views Education» more  CORR 2011»
12 years 11 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
GD
2004
Springer
14 years 1 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
ISQED
2005
IEEE
92views Hardware» more  ISQED 2005»
14 years 1 months ago
An Interconnect Insensitive Linear Time-Varying Driver Model for Static Timing Analysis
This paper presents a two-step, RC-interconnect insensitive linear time-varying (LTV) driver model for gate-level timing calculation. We show how to characterize a driver with the...
Chung-Kuan Tsai, Malgorzata Marek-Sadowska