1197 search results - page 183 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
148
click to vote
COR
2008
15 years 5 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...
248
click to vote
ECOWS
2011
Springer
14 years 5 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...
149
click to vote
RECOMB
2002
Springer
16 years 5 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...
143
click to vote
INFOCOM
2005
IEEE
15 years 11 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...
154
click to vote
GECCO
2007
Springer
15 years 11 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 ...