Sciweavers

2223 search results - page 264 / 445
» Ontological Framework for Approximation
Sort
View
124
Voted
IJMMS
1998
75views more  IJMMS 1998»
15 years 4 months ago
Knowledge modeling directed by situation-specific models
Clancey (1992) proposed the model-construction framework as a way to explain the reasoning of knowledge-based systems (KBSs), based on his realization that all KBSs construct impl...
Michel Benaroch
SEMWEB
2010
Springer
15 years 2 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
NDJFL
2010
14 years 11 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
170
Voted
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 5 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 6 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...