Sciweavers

48 search results - page 7 / 10
» Simulated Annealing for Graph Bisection
Sort
View
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 2 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
ASPLOS
2006
ACM
14 years 1 months ago
A spatial path scheduling algorithm for EDGE architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
Katherine E. Coons, Xia Chen, Doug Burger, Kathryn...
SIES
2007
IEEE
14 years 1 months ago
Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
Bastian Knerr, Martin Holzer 0002, Markus Rupp
ICCS
1993
Springer
13 years 11 months ago
Towards Domain-Independent Machine Intelligence
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
Robert Levinson
ASPDAC
2004
ACM
132views Hardware» more  ASPDAC 2004»
13 years 11 months ago
On handling arbitrary rectilinear shape constraint
Non-rectangular (rectilinear) shape occurs very often in deep submicron floorplanning. Most previous algorithms are designed to handle only convex rectilinear blocks. However, han...
Xiaoping Tang, Martin D. F. Wong