Sciweavers

741 search results - page 116 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
UAI
2008
13 years 10 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ISBRA
2007
Springer
14 years 2 months ago
Reconstruction of 3D Structures from Protein Contact Maps
Proteins are large organic compounds made of amino acids arranged in a linear chain (primary structure). Most proteins fold into unique threedimensional (3D) structures called inte...
Marco Vassura, Luciano Margara, Filippo Medri, Pie...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ECAI
2006
Springer
14 years 12 days ago
Automatic Term Categorization by Extracting Knowledge from the Web
This paper addresses the problem of categorizing terms or lexical entities into a predefined set of semantic domains exploiting the knowledge available on-line in the Web. The prop...
Leonardo Rigutini, Ernesto Di Iorio, Marco Ernande...
IPPS
2010
IEEE
13 years 6 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb