Sciweavers

9842 search results - page 1405 / 1969
» Problem complexity
Sort
View
AAAI
2004
15 years 8 months ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli
DMDW
2003
134views Management» more  DMDW 2003»
15 years 8 months ago
Using Design Guidelines to Improve Data Warehouse Logical Design
Data Warehouse-(DW) logical design often start with a conceptual schema and then generates relational structures. Applying this approach implies to cope with two main aspects: (i) ...
Verónika Peralta, Raul Ruggia
WSCG
2004
156views more  WSCG 2004»
15 years 8 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
PARCO
2003
15 years 8 months ago
Cache Memory Behavior of Advanced PDE Solvers
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
Dan Wallin, Henrik Johansson, Sverker Holmgren
AAAI
1998
15 years 8 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell
« Prev « First page 1405 / 1969 Last » Next »