2343 search results - page 45 / 469 » Visual-Concept Search Solved |
118
Voted
CORR
2010
Springer
15 years 29 days ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
102
Voted
CVPR
2001
IEEE
16 years 2 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...
101
Voted
GECCO
2008
Springer
15 years 1 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...
112
Voted
EAAI
2007
15 years 25 days 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�...
106
Voted
DAC
2008
ACM
16 years 1 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...