Sciweavers

1197 search results - page 125 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
14 years 19 days ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
CVPR
1997
IEEE
14 years 15 days ago
Shape and albedo from multiple images using integrability
Previous work [5], [2] have developed an approach for estimating shape and albedo from multiple images assuming Lambertian reflectance with single light sources. The main contrib...
Alan L. Yuille, Daniel Snow
GLOBECOM
2007
IEEE
14 years 2 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
CP
2009
Springer
14 years 9 months ago
Generating Optimal Stowage Plans for Container Vessel Bays
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
Alberto Delgado, Christian Schulte, Rune Mø...
PADL
2007
Springer
14 years 2 months ago
From Zinc to Design Model
We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically...
Reza Rafeh, Maria J. García de la Banda, Ki...