4117 search results - page 50 / 824 » On the Satisfiability of Complex Constraints |
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the e...
107
click to vote
CGF
1999
14 years 11 months ago
1999
A fast design variation technique for mechanical systems is presented. It is used to interactively optimize mechanical characteristics while "self-assembling" or satisfy...
101
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
EVOW
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
130
click to vote
FSTTCS
1993
Springer
15 years 4 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...