Sciweavers

1160 search results - page 133 / 232
» Dynamic Programming Algorithm for Training Functional Networ...
Sort
View
147
Voted
MOBIQUITOUS
2007
IEEE
15 years 8 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
126
Voted
AIPS
2008
15 years 4 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
IEEEPACT
2000
IEEE
15 years 7 months ago
Region Formation Analysis with Demand-Driven Inlining for Region-Based Optimization
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
Tom Way, Ben Breech, Lori L. Pollock
CORR
2011
Springer
182views Education» more  CORR 2011»
14 years 9 months ago
Cyber-Physical Attacks in Power Networks: Models, Fundamental Limitations and Monitor Design
— Future power networks will be characterized by safe and reliable functionality against physical malfunctions and cyber attacks. This paper proposes a unified framework and adv...
Fabio Pasqualetti, Florian Dörfler, Francesco...
INFOCOM
2002
IEEE
15 years 7 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...