1197 search results - page 121 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
TON
2002
13 years 8 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
ESWS
2007
Springer
14 years 2 months ago
2007
Springer
Traditional process support systems typically offer a static composition of atomic tasks to more powerful services. In the real world, however, processes change over time: busines...
DATE
2000
IEEE
14 years 21 days ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
CVIU
2011
12 years 11 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
ASYNC
1998
IEEE
14 years 16 days ago
1998
IEEE
None of the available minimizers for exact 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to heuristic...