Sciweavers

9818 search results - page 374 / 1964
» Much Support and More
Sort
View
AAAI
2004
15 years 8 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
AAAI
2006
15 years 8 months ago
Finding Maximally Satisfiable Terminologies for the Description Logic ALC
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
Thomas Andreas Meyer, Kevin Lee, Richard Booth, Je...
CGVR
2006
15 years 8 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
CSREAEEE
2006
112views Business» more  CSREAEEE 2006»
15 years 8 months ago
A Development Tool for E-learning Applications
Task information support on the Web is not always an easy and straightforward process. Much of the information is inaccurate, biased, out-of-date, or just not thorough enough. The...
Darina Dicheva, Christo Dichev, Mohammed Ketel
ICEB
2004
131views Business» more  ICEB 2004»
15 years 8 months ago
Negative Reputation Rate as the Signal of Risk in Online Consumer-to-consumer Transactions
Previous online reputation research has been focused on the effects of positive and negative reputations on trust formation, trading price, and probability of sale. We propose tha...
Dahui Li, Zhangxi Lin