Sciweavers

392 search results - page 10 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
ACSD
2008
IEEE
108views Hardware» more  ACSD 2008»
13 years 8 months ago
Modular construction of finite and complete prefixes of Petri net unfoldings
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
Agnes Madalinski, Eric Fabre
JSAC
2006
180views more  JSAC 2006»
13 years 6 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang
ICPR
2008
IEEE
14 years 1 months ago
FCM-based orientation selection for competitive coding-based palmprint recognition
Coding based methods are among the most promising palmprint recognition methods. As one representative coding method, the competitive code first convolves the palmprint image with...
Feng Yue, Wangmeng Zuo, Kuanquan Wang, David Zhang
COMPLEXITY
2004
81views more  COMPLEXITY 2004»
13 years 6 months ago
External and internal control in plant development
Bodies of plants are modularly organized. Development proceeds by adding new modules to open endings with a potential for branching. Each module is autonomous to some extent. Deve...
Beáta Oborny
COCOON
2008
Springer
13 years 8 months ago
Average-Case Competitive Analyses for One-Way Trading
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi