1197 search results - page 143 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
SOCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In addition to publishing composite services as reusable services, compositions can also be reused by applying them to orchestrate different component services. To do so...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...