281 search results - page 36 / 57 » The Complexity of Planar Counting Problems |
CEC
2009
IEEE
14 years 14 days ago
2009
IEEE
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
Publication
Due to the sequential-readout structure of complementary-metal-oxide semiconductor image sensor array, each scanline of the acquired image is exposed at a different time, resulting...
COSIT
2003
Springer
14 years 1 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
TCS
2008
13 years 7 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...