Sciweavers

1086 search results - page 173 / 218
» Programming by Numbers: A Programming Method for Novices
Sort
View
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
14 years 1 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
14 years 1 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
IPPS
1998
IEEE
14 years 1 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
GCB
1998
Springer
78views Biometrics» more  GCB 1998»
14 years 1 months ago
Computational approaches to identify Leucine Zippers
The leucine zipper is a dimerization domain occurring mostly in regulatory and thus in many oncogenic proteins. The leucine repeat in the sequence has been traditionally used for ...
Erich Bornberg-Bauer
FOCS
1992
IEEE
14 years 26 days ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo