Sciweavers

387 search results - page 17 / 78
» Many Random Walks Are Faster Than One
Sort
View
IROS
2007
IEEE
160views Robotics» more  IROS 2007»
14 years 3 months ago
Task constrained motion planning in robot joint space
— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...
Mike Stilman
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 2 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 7 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
14 years 3 months ago
3D floorplanning with thermal vias
Abstract— 3D circuits have the potential to improve performance over traditional 2D circuits by reducing wirelength and interconnect delay. One major problem with 3D circuits is ...
Eric Wong, Sung Kyu Lim
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta