Sciweavers

235 search results - page 27 / 47
» Average-case complexity and decision problems in group theor...
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
AI
2008
Springer
13 years 6 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
FSKD
2007
Springer
140views Fuzzy Logic» more  FSKD 2007»
14 years 1 months ago
QoS-Aware Web Service Selection by a Synthetic Weight
The selection of web services according to different quality of service (QoS) is one of the most important decision issues for which complex considerations are involved. In many c...
PengCheng Xiong, Yushun Fan
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
COMPGEOM
2009
ACM
14 years 2 months ago
Zigzag persistent homology and real-valued functions
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
Gunnar Carlsson, Vin de Silva, Dmitriy Morozov