Sciweavers

3702 search results - page 149 / 741
» All Pairings Are in a Group
Sort
View
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
16 years 3 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
COMPGEOM
2004
ACM
15 years 12 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
DEXA
2010
Springer
319views Database» more  DEXA 2010»
15 years 6 months ago
An Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
Dongjoo Lee, Jaehui Park, Junho Shim, Sang-goo Lee
TCAD
2008
124views more  TCAD 2008»
15 years 6 months ago
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
Neil Kettle, Andy King
RSS
2007
140views Robotics» more  RSS 2007»
15 years 8 months ago
Control of Many Agents Using Few Instructions
— This paper considers the problem of controlling a group of agents under the constraint that every agent must be given the same control input. This problem is relevant for the c...
Timothy Bretl