849 search results - page 134 / 170 » On the Complexity of the Whitehead Minimization Problem |
GECCO
2000
Springer
14 years 25 days ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
EURODAC
1995
IEEE
14 years 24 days ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
ECCV
2010
Springer
14 years 17 days ago
2010
Springer
Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricti...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
ISPD
2007
ACM
13 years 10 months ago
2007
ACM
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...