Sciweavers

3838 search results - page 7 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
AIPS
2009
14 years 10 months ago
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...
Sarah L. Hickmott, Sebastian Sardiña
EMS
2008
IEEE
14 years 11 months ago
Threat Modeling Revisited: Improving Expressiveness of Attack
Threat modeling plays an important role in the deployment of optimal security controls and a number of threat modeling techniques have been proposed. However, most of the existing...
Drake Patrick Mirembe, Maybin K. Muyeba
DAC
2009
ACM
15 years 2 months ago
GRIP: scalable 3D global routing using integer programming
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
PPSN
2004
Springer
15 years 3 months ago
AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
ICCAD
2000
IEEE
91views Hardware» more  ICCAD 2000»
15 years 2 months ago
A Timing-Constrained Algorithm for Simultaneous Global Routing of Multiple Nets
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar