Sciweavers

193 search results - page 34 / 39
» A Tractable Class of Abduction Problems
Sort
View
IJCAI
2007
13 years 8 months ago
Mechanism Design with Partial Revelation
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
Nathanael Hyafil, Craig Boutilier
MP
2006
87views more  MP 2006»
13 years 7 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
STACS
2009
Springer
14 years 1 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
MFCS
2007
Springer
14 years 1 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
ICLP
2005
Springer
14 years 18 days ago
OWL: A Description Logic Based Ontology Language
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Ian Horrocks