12289 search results - page 1664 / 2458 » computing 2006 |
206
click to vote
AAAI
2006
15 years 9 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
238
click to vote
GRID
2006
Springer
15 years 7 months ago
2006
Springer
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
200
click to vote
SAC
2006
ACM
15 years 7 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
193
click to vote
SAC
2006
ACM
16 years 1 months ago
2006
ACM
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
197
click to vote
CG
2006
Springer
15 years 7 months ago
2006
Springer
Diffusion Limited Aggregation (DLA) has usually been studied in 2 dimensions as a model of fractal growth processes such as river networks, plant branching, frost on glass, electr...