Sciweavers

2057 search results - page 185 / 412
» Quadratic placement using an improved timing model
Sort
View
DAC
1999
ACM
16 years 7 months ago
Hypergraph Partitioning with Fixed Vertices
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leading-edge multilevel hypergraph partit...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
IROS
2009
IEEE
187views Robotics» more  IROS 2009»
16 years 1 months ago
Compliant quadruped locomotion over rough terrain
— Many critical elements for statically stable walking for legged robots have been known for a long time, including stability criteria based on support polygons, good foothold se...
Jonas Buchli, Mrinal Kalakrishnan, Michael Mistry,...
NOCS
2008
IEEE
16 years 28 days ago
Network Simplicity for Latency Insensitive Cores
In this paper we examine a latency insensitive network composed of very fast and simple circuits that connects SoC cores that are also latency insensitive, de-synchronized, or asy...
Daniel Gebhardt, JunBok You, W. Scott Lee, Kenneth...
DEXA
2001
Springer
151views Database» more  DEXA 2001»
15 years 11 months ago
Cache Conscious Clustering C3
The two main techniques of improving I/O performance of Object Oriented Database Management Systems(OODBMS) are clustering and buffer replacement. Clustering is the placement of o...
Zhen He, Alonso Marquez
JAIR
2011
129views more  JAIR 2011»
15 years 1 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek