Concept
Tas (informatique)
Publications associées (44)
Quasi-periodic distribution of plasmon modes in two-dimensional Fibonacci arrays of metal nanoparticles
n this paper we investigate for the first time the near-field optical behavior of two-dimensional Fibonacci plasmonic lattices fabricated by electron-beam lithography on transparent quartz substrates. In particular, by performing near-field optical microsc ...
Optical Society of America2008A Unified Framework for Max-Min and Min-Max Fairness with Applications
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...
2007On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube
P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer pop- ulation dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the split maintena ...
GI2007Fibonacci Heaps
Ali Chekir, Mohamed Slim Slama
Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...
2006A Unified Framework for Max-Min and Min-Max Fairness with Applications
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
2006Energy-efficient dynamic memory allocators at the middleware level of embedded systems
The next generation of embedded systems will be dominated by mobile devices, which are able to deliver communications and rich multimedia content anytime, anywhere. The major themes in these ubiquitous computing systems are applications with increased user ...
ACM2006Oscar: Small-world overlay for realistic key distributions
Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas
The research on P2P systems which support skewed key distributions has rapidly advanced in the recent years. Yet, the assumptions on the skews we are dealing with remained pretty simple: most of the existing literature assumes simple monotonous key distrib ...
2006Lazy Shape Analysis
Dirk Thilo Beyer, Grégory Théoduloz
Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analy ...
Springer2006A Unified Framework for Max-Min and Min-Max Fairness with Applications
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair alloca-tion ...
2004A Unified Framework for Max-Min and Min-Max Fairness with Applications
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
2002