Sciweavers

1480 search results - page 234 / 296
» Ants can solve constraint satisfaction problems
Sort
View
CVPR
2010
IEEE
15 years 7 months ago
Towards Internet-scale Multi-view Stereo
This paper introduces an approach for enabling existing multi-view stereo methods to operate on extremely large unstructured photo collections. The main idea is to decompose the c...
Yasutaka Furukawa, Steve Seitz, Richard Szeliski
DATE
2009
IEEE
147views Hardware» more  DATE 2009»
15 years 6 months ago
Decoupling capacitor planning with analytical delay model on RLC power grid
— Decoupling capacitors (decaps) are typically used to reduce the noise in the power supply network. Because the delay of gates and interconnects is affected by the supply voltag...
Ye Tao, Sung Kyu Lim
IFIP
2007
Springer
15 years 6 months ago
A Framework for QoS Contract Negotiation in Component-Based Applications
The support of QoS properties in component-based software requires the run-time selection of appropriate concrete QoS contracts at the ports of the interacting components. Such a s...
Mesfin Mulugeta, Alexander Schill
CP
2005
Springer
15 years 5 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
PG
2003
IEEE
15 years 5 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart