Sciweavers

3359 search results - page 104 / 672
» A Simplified Idea Algorithm
Sort
View
IPPS
1996
IEEE
15 years 6 months ago
Generic Methodologies for Deadlock-Free Routing
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
Hyunmin Park, Dharma P. Agrawal
143
Voted
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 6 months ago
Understanding particle swarms through simplification: a study of recombinant PSO
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
Daniel Bratton, Tim Blackwell
111
Voted
DATE
2004
IEEE
92views Hardware» more  DATE 2004»
15 years 6 months ago
Optimization of Integrated Spiral Inductors Using Sequential Quadratic Programming
The optimization of integrated spiral inductors has great practical importance. Previous optimization methods used in this field are either too slow or depend on very simplified a...
Yong Zhan, Sachin S. Sapatnekar
AAAI
2008
15 years 4 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
ASIAN
2005
Springer
102views Algorithms» more  ASIAN 2005»
15 years 4 months ago
General Consistency Management Within the Development of Ontology-Driven Web Information System
This paper proposes a general consistency management methodology within ontology-driven WIS development. The contributions of this paper are follows: 1) introduces the concept stru...
Baojun Qiu, Hongyan Li, Zijing Hu, Dongqing Yang, ...