16082 search results - page 560 / 3217 » Fireworks Algorithm for Optimization |
195
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
- 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...
191
Voted
ER
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
208
click to vote
EUC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the u...
205
Voted
3DIM
2001
IEEE
15 years 10 months ago
2001
IEEE
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
155
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...