350 search results - page 47 / 70 » Hardness Results for Homology Localization |
FLAIRS
2006
13 years 9 months ago
2006
Advances in sensing and communication technology make sensor networks a convenient and cost effective tool for collecting data in hard to reach and hazardous areas Increasingly, s...
ESM
2000
13 years 9 months ago
2000
Blocking probabilities in Wavelength Division Multiplex optical networks are hard to compute for realistic sized systems, even though analytical formulas for the distribution exis...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...
ANOR
2007
13 years 8 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
DISOPT
2010
13 years 8 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...