Sciweavers

1557 search results - page 75 / 312
» Programming up to Congruence
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 4 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ICCAD
1999
IEEE
86views Hardware» more  ICCAD 1999»
15 years 3 months ago
Clock skew scheduling for improved reliability via quadratic programming
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
Ivan S. Kourtev, Eby G. Friedman
78
Voted
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 3 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
TREC
2003
15 years 14 days ago
Ranking Function Discovery by Genetic Programming for Robust Retrieval
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
Li Wang, Weiguo Fan, Rui Yang, Wensi Xi, Ming Luo,...
OOPSLA
2010
Springer
14 years 9 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler