Sciweavers

864 search results - page 88 / 173
» A general markov framework for page importance computation
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
CLOUD
2010
ACM
14 years 2 months ago
Differential virtual time (DVT): rethinking I/O service differentiation for virtual machines
This paper investigates what it entails to provide I/O service diļ¬€erentiation and performance isolation for virtual machines on individual multicore nodes in cloud platforms. Sh...
Mukil Kesavan, Ada Gavrilovska, Karsten Schwan
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 26 days ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
AAMAS
2007
Springer
13 years 9 months ago
Shaping multi-agent systems with gradient reinforcement learning
An original Reinforcement Learning (RL) methodology is proposed for the design of multi-agent systems. In the realistic setting of situated agents with local perception, the task o...
Olivier Buffet, Alain Dutech, François Char...
AI
2006
Springer
13 years 9 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo