1197 search results - page 138 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
NDSS
2007
IEEE
14 years 2 months ago
2007
IEEE
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
AGENTS
2000
Springer
14 years 17 days ago
2000
Springer
Many applied problems in domains such as military operations, manufacturing, and logistics require that entities change location under certain constraints. These problems are trad...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
DAC
2010
ACM
13 years 8 months ago
2010
ACM
Decoupling capacitor (decap) placement has been widely adopted as an effective way to suppress dynamic power supply noise. Traditional decap budgeting algorithms usually explore t...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper, we focus on the Image Registration problem. Mathematically, this problem consists of minimizing an energy which is composed of a regularization term and a similarit...