Sciweavers

2125 search results - page 213 / 425
» On Graph Complexity
Sort
View
MSN
2007
Springer
15 years 9 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 4 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
142
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
MSE
2002
IEEE
91views Hardware» more  MSE 2002»
15 years 8 months ago
A Visual Authoring Environment for Prototyping Multimedia Presentations
In this paper we describe an authoring environment which allows the author to set up and test a complex multimedia presentation by defining the synchronization relationships amon...
Ombretta Gaggi, Augusto Celentano
NAACL
2003
15 years 4 months ago
Unsupervised Learning of Morphology for English and Inuktitut
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
Howard Johnson, Joel D. Martin