1218 search results - page 79 / 244 » The many facets of natural computing |
186
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
156
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
159
click to vote
HPCC
2010
Springer
15 years 6 months ago
2010
Springer
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
182
click to vote
NPC
2010
Springer
15 years 4 months ago
2010
Springer
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
147
click to vote
SG
2010
Springer
15 years 4 months ago
2010
Springer
Like many natural phenomenon, clouds are often modeled using procedural methods, which may be difficult for an artist to control. In this paper, a freehand sketching system is prop...