Sciweavers

4894 search results - page 693 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
122
Voted
AIA
2007
15 years 4 months ago
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...
Sérgio R. de M. Queiroz
85
Voted
BIS
2007
105views Business» more  BIS 2007»
15 years 4 months ago
Improving the Accuracy of Job Search with Semantic Techniques
In this paper we introduce a prototype job portal which uses semantically annotated job offers and applicants. In our opinion, using Semantic Web technologies substantially increa...
Malgorzata Mochol, Holger Wache, Lyndon J. B. Nixo...
CLA
2007
15 years 4 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil
113
Voted
DAGSTUHL
2007
15 years 4 months ago
An Inner/Outer Stationary Iteration for Computing PageRank
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
Andrew P. Gray, Chen Greif, Tracy Lau
120
Voted
FCS
2008
15 years 4 months ago
Autonomous Scheduling
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
Chetan Yadati, Cees Witteveen, Yingqian Zhang, Men...