Sciweavers

1022 search results - page 24 / 205
» New models and algorithms for programmable networks
Sort
View
AAAI
2006
15 years 3 months ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
Christian Bessière, Remi Coletta, Fré...
179
Voted
LCN
2005
IEEE
15 years 7 months ago
The Time-Controlled Clustering Algorithm for Optimized Data Dissemination in Wireless Sensor Networks
—Wireless sensor networks afford a new opportunity to observe and interact with physical phenomena at an unprecedented fidelity. To fully realize this vision, these networks have...
S. Selvakennedy, Sukunesan Sinnappan
116
Voted
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 10 days ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
FGCS
2006
83views more  FGCS 2006»
15 years 1 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
129
Voted
SENSYS
2003
ACM
15 years 7 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...