Sciweavers

635 search results - page 84 / 127
» Four states are enough!
Sort
View
NSDI
2004
13 years 11 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
JAIR
2011
134views more  JAIR 2011»
13 years 5 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
INFOCOM
2011
IEEE
13 years 1 months ago
Experimental evaluation of optimal CSMA
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
Bruno Nardelli, Jinsung Lee, Kangwook Lee, Yung Yi...
BMCBI
2006
159views more  BMCBI 2006»
13 years 10 months ago
Prediction of protein continuum secondary structure with probabilistic models based on NMR solved structures
Background: The structure of proteins may change as a result of the inherent flexibility of some protein regions. We develop and explore probabilistic machine learning methods for...
Mikael Bodén, Zheng Yuan, Timothy L. Bailey

Lab
667views
14 years 7 months ago
Digital Systems and Media Computing Laboratory - DSMC
The Digital Systems and Media Computing Laboratory (DSMC Lab) was established in the end of 2002 and is located in Patras, Greece. DSMC operates under the School of Sciences and Te...