1197 search results - page 109 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
UAI
2008
13 years 9 months ago
2008
Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be...
SECURWARE
2008
IEEE
14 years 2 months ago
2008
IEEE
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
CIKM
2001
Springer
14 years 25 days ago
2001
Springer
As mobile devices get ubiquitous and grow in computational power, their management of interdependent data also becomes increasingly important. The mobile environment exhibits all ...
PEPM
1993
ACM
14 years 12 days ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
FMCAD
2007
Springer
14 years 2 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...