Sciweavers

10988 search results - page 410 / 2198
» Algorithmic Folding Complexity
Sort
View
VRML
1997
ACM
15 years 9 months ago
Lodestar: An Octree-Based Level of Detail Generator for VRML
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...
Dieter Schmalstieg
ACL
1993
15 years 6 months ago
Principle-Based Parsing without Overgeneration
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that...
Dekang Lin
SIAMMA
2011
71views more  SIAMMA 2011»
15 years 2 days ago
Reconstruction of Penetrable Obstacles in Acoustic Scattering
We develop a reconstruction algorithm to determine penetrable obstacles inside a domain in the plane from acoustic measurements made on the boundary. This algorithm uses complex g...
Sei Nagayasu, Gunther Uhlmann, Jenn-Nan Wang
ICNC
2009
Springer
15 years 11 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
ICWS
2007
IEEE
15 years 6 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni