895 search results - page 134 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
141
click to vote
WADS
2007
Springer
16 years 19 days ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
179
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
148
click to vote
ICALP
2005
Springer
16 years 2 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
167
click to vote
SERVICES
2008
15 years 8 months ago
2008
In Service Oriented Architecture, each application is ofgned as a set of abstract services, which defines its functions. A concrete service(s) is selected at runtime for tract ser...
164
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...