1197 search results - page 183 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
COR
2008
13 years 8 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
ECOWS
2011
Springer
12 years 7 months ago
2011
Springer
Abstract—One of the key concepts of service-oriented computing is dynamic binding which favors on-demand integration of services into a running system. Companies can outsource ta...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...