Sciweavers

1722 search results - page 158 / 345
» On the sample mean of graphs
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
16 years 18 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
GG
2008
Springer
15 years 8 months ago
Model-Driven Development of Model Transformations
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
Pieter Van Gorp
JASIS
2010
170views more  JASIS 2010»
15 years 5 months ago
Analyzing URL queries
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
Wei Meng Lee, Mark Sanderson
ADAEUROPE
2008
Springer
16 years 1 months ago
A Framework for CFG-Based Static Program Analysis of Ada Programs
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
Raul Fechete, Georg Kienesberger, Johann Blieberge...
ECTEL
2007
Springer
16 years 1 months ago
Adaptation of the ACO Heuristic for Sequencing Learning Activities
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...
Sergio Gutiérrez Santos, Grégory Val...