Sciweavers

5158 search results - page 803 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
IJACTAICIT
2010
155views more  IJACTAICIT 2010»
15 years 3 months ago
Constructive Dynamic Program Slicing Research
Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the ...
Jaakko Korpi, Jussi Koskinen
DSS
2002
231views more  DSS 2002»
15 years 6 months ago
Computational aspects of the FLBC framework
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Aspassia Daskalopulu, Marek J. Sergot
AI
2011
Springer
15 years 1 months ago
Learning qualitative models from numerical data
Qualitative models are often a useful abstraction of the physical world. Learning qualitative models from numerical data sible way to obtain such an abstraction. We present a new ...
Jure Zabkar, Martin Mozina, Ivan Bratko, Janez Dem...
198
Voted
ACMSE
2010
ACM
15 years 1 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
15 years 1 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely