Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AAIM
2005
Springer
81views Algorithms» more  AAIM 2005»
10 years 6 months ago
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
Xiao-Dong Hu, Tianping Shuai
AAIM
2005
Springer
119views Algorithms» more  AAIM 2005»
10 years 6 months ago
Locating Performance Monitoring Mobile Agents in Scalable Active Networks
The idea of active networks has been emerged in recent years to increase the processing power inside the network. The intermediate nodes such as routers will be able to host mobile...
Amir Hossein Hadad, Mehdi Dehghan, Hossein Pedram
AAIM
2005
Springer
173views Algorithms» more  AAIM 2005»
10 years 10 months ago
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gregory Gutin, Arash Rafiey, Anders Yeo, Michael T...
AAIM
2005
Springer
75views Algorithms» more  AAIM 2005»
10 years 10 months ago
Mechanism Design for Set Cover Games When Elements Are Agents
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
Zheng Sun, Xiang-Yang Li, Weizhao Wang, Xiaowen Ch...
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
10 years 10 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
10 years 10 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
AAIM
2005
Springer
132views Algorithms» more  AAIM 2005»
10 years 10 months ago
Computation of Arbitrage in a Financial Market with Various Types of Frictions
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li
books