Sciweavers

473 search results - page 52 / 95
» The Price of Validity in Dynamic Networks
Sort
View
ENDM
2010
105views more  ENDM 2010»
13 years 8 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
AIPS
2008
13 years 10 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
EWSN
2011
Springer
12 years 11 months ago
Prediction Accuracy of Link-Quality Estimators
Abstract. The accuracy of link-quality estimators (LQE) is missioncritical in many application scenarios in wireless sensor networks (WSN), since the link-quality metric is used fo...
Christian Renner, Sebastian Ernst, Christoph Weyer...
IPPS
2007
IEEE
14 years 2 months ago
Modeling of NAMD's Network Input/Output on Large PC Clusters
This study examined the interplay among processor speed, cluster interconnect and file I/O, using parallel applications to quantify interactions. We focused on a common case wher...
Nancy Tran, Daniel A. Reed
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
14 years 2 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...