1197 search results - page 228 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
FAW
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
JAIR
2006
13 years 8 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
SIGSOFT
2010
ACM
13 years 6 months ago
2010
ACM
The Student Contest on Software Engineering (SCORE), organized for the first time in conjunction with the International Conference on Software Engineering (ICSE) 2009, attracted 5...
OSDI
2008
ACM
14 years 8 months ago
2008
ACM
The increasing use of computers for saving valuable data imposes stringent reliability constraints on storage systems. Reliability improvement via use of redundancy is a common pr...