1480 search results - page 179 / 296 » Ants can solve constraint satisfaction problems |
189
click to vote
NIPS
2003
15 years 8 months ago
2003
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
185
click to vote
CVPR
2006
IEEE
16 years 8 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...
156
click to vote
ADG
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper, we introduce the concept of planar generalized Stewart platform (GSP) consisting of two rigid bodies connected with three constraints between three pairs o...
187
click to vote
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
178
click to vote
CAEPIA
2009
Springer
15 years 7 months ago
2009
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...