6036 search results - page 137 / 1208 » Web search solved |
158
click to vote
CVPR
2001
IEEE
16 years 7 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
172
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
172
click to vote
EAAI
2007
15 years 5 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de�...
206
click to vote
PERCOM
2005
ACM
16 years 5 months ago
2005
ACM
It is expected that more and more people will search the web when they are on the move. Though conventional search engines can be directly visited from mobile devices with web bro...
163
click to vote
DAC
2008
ACM
16 years 6 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...