Sciweavers

3637 search results - page 145 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
ICC
2011
IEEE
272views Communications» more  ICC 2011»
12 years 9 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
ICIP
2009
IEEE
14 years 10 months ago
The Dynamics Of Image Processing Viewed As Damped Elastic Deformation
Diffusion-type algorithms have been integrated in recent years successfully into the toolbox of image processing. We introduce a new more flexible and powerful family of parabolic...
CADE
2006
Springer
14 years 9 months ago
Specifying and Reasoning About Dynamic Access-Control Policies
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
Daniel J. Dougherty, Kathi Fisler, Shriram Krishna...
HICSS
2010
IEEE
145views Biometrics» more  HICSS 2010»
14 years 4 months ago
Dynamics of an Economics Model for Generation Coupled to the OPA Power Transmission Model
In this paper we explore the interaction between a dynamic model of the power transmission system (OPA) and a simple economic model of power generation development. Despite the si...
Benjamin A. Carreras, David E. Newman, Matthew Zei...
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
14 years 4 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer