Sciweavers

1941 search results - page 290 / 389
» On the Hardness of Approximate Reasoning
Sort
View
JIIS
2006
147views more  JIIS 2006»
15 years 6 months ago
Mining sequential patterns from data streams: a centroid approach
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...
Alice Marascu, Florent Masseglia
FSS
2007
102views more  FSS 2007»
15 years 6 months ago
Extraction of fuzzy rules from support vector machines
The relationship between support vector machines (SVMs) and Takagi–Sugeno–Kang (TSK) fuzzy systems is shown. An exact representation of SVMs as TSK fuzzy systems is given for ...
Juan Luis Castro, L. D. Flores-Hidalgo, Carlos Jav...
AI
2005
Springer
15 years 6 months ago
Adopt: asynchronous distributed constraint optimization with quality guarantees
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
ALGORITHMICA
2005
92views more  ALGORITHMICA 2005»
15 years 6 months ago
Average-Case Competitive Analyses for Ski-Rental Problems
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after r...
Hiroshi Fujiwara, Kazuo Iwama
CORR
2000
Springer
132views Education» more  CORR 2000»
15 years 6 months ago
Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
Marc Denecker, Victor W. Marek, Miroslaw Truszczyn...