Sciweavers

7167 search results - page 479 / 1434
» Answer Set Programming
Sort
View
150
Voted
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 9 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
AGILEDC
2003
IEEE
15 years 9 months ago
YP and Urban Simulation: Applying an Agile Programming Methodology in a Politically Tempestuous Domain
YP is an agile programming methodology that has evolved over the past 15 years. Many of its features are common to other agile methodologies; its novel features include using a hi...
Bjørn N. Freeman-Benson, Alan Borning
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 8 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
PEPM
1994
ACM
15 years 8 months ago
Partial Evaluation of Numerical Programs in Fortran
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
Romana Baier, Robert Glück, Robert Zöchl...
CF
2010
ACM
15 years 7 months ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...