Sciweavers

1646 search results - page 88 / 330
» fast 2007
Sort
View
120
Voted
ISICA
2007
Springer
15 years 7 months ago
A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Changhe Li, Yong Liu, Aimin Zhou, Lishan Kang, Hui...
87
Voted
PSIVT
2007
Springer
135views Multimedia» more  PSIVT 2007»
15 years 7 months ago
Fast Directional Image Completion
Abstract. We developed a fast image completion system using the multiresolution approach to accelerate the convergence of the system. The downsampling approach is for the texture-e...
Chih-Wei Fang, Jenn-Jier James Lien
128
Voted
ROBOCUP
2007
Springer
99views Robotics» more  ROBOCUP 2007»
15 years 7 months ago
Instance-Based Action Models for Fast Action Planning
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...
Mazda Ahmadi, Peter Stone
121
Voted
RTA
2007
Springer
15 years 7 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 4 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang