Sciweavers

840 search results - page 162 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 4 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
DFT
2006
IEEE
105views VLSI» more  DFT 2006»
14 years 3 months ago
Thermal-Aware SoC Test Scheduling with Test Set Partitioning and Interleaving
1 High temperature has become a major problem for system-on-chip testing. In order to reduce the test time while keeping the temperature of the chip under test within a safe range,...
Zhiyuan He, Zebo Peng, Petru Eles, Paul M. Rosinge...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolving distributed agents for managing air traffic
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
Adrian K. Agogino, Kagan Tumer
BMCBI
2006
138views more  BMCBI 2006»
13 years 9 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
MOBIHOC
2006
ACM
14 years 9 months ago
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Smart antennas have gained significant importance in multihop wireless networks in recent years, because of their sophisticated signal processing capabilities that hold the potent...
Karthikeyan Sundaresan, Weizhao Wang, Stephan Eide...