Sciweavers

260 search results - page 51 / 52
» Resolution Complexity of Independent Sets in Random Graphs
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
ISBRA
2007
Springer
13 years 11 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...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
AAAI
2011
12 years 5 months ago
Learned Behaviors of Multiple Autonomous Agents in Smart Grid Markets
One proposed approach to managing a large complex Smart Grid is through Broker Agents who buy electrical power from distributed producers, and also sell power to consumers, via a ...
Prashant P. Reddy, Manuela M. Veloso
CONCUR
2009
Springer
13 years 11 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...