Sciweavers

4555 search results - page 553 / 911
» Deductive Algorithmic Knowledge
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 6 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
ESWA
2007
127views more  ESWA 2007»
15 years 6 months ago
Clustering support vector machines for protein local structure prediction
Understanding the sequence-to-structure relationship is a central task in bioinformatics research. Adequate knowledge about this relationship can potentially improve accuracy for ...
Wei Zhong, Jieyue He, Robert W. Harrison, Phang C....
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
INFOCOM
2010
IEEE
15 years 4 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
MDM
2010
Springer
188views Communications» more  MDM 2010»
15 years 4 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...