3025 search results - page 409 / 605 » Automatic Programming of Robots Using Genetic Programming |
234
click to vote
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
127
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
116
Voted
ASPLOS
2010
ACM
15 years 10 months ago
2010
ACM
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
133
click to vote
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...
150
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...