Sciweavers

4342 search results - page 637 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 10 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
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 6 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
ICS
1999
Tsinghua U.
15 years 9 months ago
Software trace cache
—This paper explores the use of compiler optimizations which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying ...
Alex Ramírez, Josep-Lluis Larriba-Pey, Carl...
168
Voted
AI
2010
Springer
15 years 5 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
SIGGRAPH
2000
ACM
15 years 9 months ago
Timewarp rigid body simulation
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
Brian Mirtich