Sciweavers

3758 search results - page 235 / 752
» A Complete Subsumption Algorithm
Sort
View
CADE
2010
Springer
15 years 7 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
164
Voted
DKE
2008
100views more  DKE 2008»
15 years 6 months ago
PeRSSonal's core functionality evaluation: Enhancing text labeling through personalized summaries
In this manuscript we present the summarization and categorization subsystems of a complete mechanism that begins with web-page fetching and concludes with representation of the c...
Christos Bouras, Vassilis Poulopoulos, Vassilis Ts...
IANDC
2006
86views more  IANDC 2006»
15 years 6 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
IJRR
2008
67views more  IJRR 2008»
15 years 6 months ago
Sampling-based Falsification and Verification of Controllers for Continuous Dynamic Systems
: In this paper, we present a sampling-based verification algorithm for continuous dynamic systems with uncertainty due to adversaries, unmodeled disturbance inputs, unknown parame...
Peng Cheng, Vijay Kumar
HEURISTICS
2007
76views more  HEURISTICS 2007»
15 years 6 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis