Sciweavers

16430 search results - page 741 / 3286
» On Computable Tree Functions
Sort
View
ECOOP
2004
Springer
16 years 26 days ago
Rewritable Reference Attributed Grammars
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...
Torbjörn Ekman, Görel Hedin
ICCS
2004
Springer
16 years 25 days ago
ABSDM: Agent Based Service Discovery Mechanism in Internet
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...
Shijian Li, Congfu Xu, Zhaohui Wu, Yunhe Pan, Xuel...
IPTPS
2004
Springer
16 years 25 days ago
2 P2P or Not 2 P2P?
In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge how suitable a P2P solution might be for a particular problem. It is bas...
Mema Roussopoulos, Mary Baker, David S. H. Rosenth...
COCOON
1999
Springer
15 years 11 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
GECCO
1999
Springer
116views Optimization» more  GECCO 1999»
15 years 11 months ago
Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhon...