Sciweavers

4698 search results - page 9 / 940
» Making Functionality More General
Sort
View
ECAI
2004
Springer
15 years 1 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
MAGS
2008
121views more  MAGS 2008»
14 years 9 months ago
A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
This paper presents a decentralized model that allows self-interested agents to reach "win-win" agreements in a multi-attribute negotiation. The model is based on an alt...
Guoming Lai, Katia P. Sycara, Cuihong Li
95
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SEMWEB
2011
Springer
14 years 10 days ago
Watson, more than a Semantic Web search engine
In this tool report, we present an overview of the Watson system, a Semantic Web search engine providing various functionalities not only to find and locate ontologies and semanti...
Mathieu d'Aquin, Enrico Motta
105
Voted
ISDA
2009
IEEE
15 years 4 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...