Sciweavers

6740 search results - page 1027 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CISS
2008
IEEE
16 years 1 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
IPPS
2008
IEEE
16 years 1 months ago
Automatic middleware deployment planning on heterogeneous platforms
Abstract— The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalabili...
Pushpinder-Kaur Chouhan, Eddy Caron, Fréd&e...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 29 days ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
16 years 9 days ago
ATNoSFERES revisited
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
Samuel Landau, Olivier Sigaud, Marc Schoenauer
« Prev « First page 1027 / 1348 Last » Next »