Sciweavers

2343 search results - page 377 / 469
» The Locomotive Routing Problem
Sort
View
178
Voted
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
15 years 2 months ago
Asynchronous distributed optimization with minimal communication and connectivity preservation
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...
Minyi Zhong, Christos G. Cassandras
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 1 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
249
Voted
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 8 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
DMGT
2011
94views more  DMGT 2011»
14 years 8 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
163
Voted
DCOSS
2011
Springer
14 years 4 months ago
Transmission Control Policy design for decentralized detection in sensor networks
—A Wireless Sensor Network (WSN) deployed for detection applications has the distinguishing feature that sensors cooperate to perform the detection task. Therefore, the decoupled...
Ashraf Tantawy, Xenofon D. Koutsoukos, Gautam Bisw...