85 search results - page 5 / 17 » Hardness of Optimal Spaced Seed Design |
GECCO
2000
Springer
14 years 1 months ago
2000
Springer
This paper describes an evolutionary way to acquire behaviors of a mobile robot for recognizing environments. We have proposed AEM (Action-based Environment Modeling) approach for...
ICS
2007
Tsinghua U.
14 years 4 months ago
2007
Tsinghua U.
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
SIAMCOMP
2000
13 years 9 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
LCTRTS
2001
Springer
14 years 2 months ago
2001
Springer
This paper presents an end-to-end synthesis technique for lowpower distributed real-time system design. This technique synthesizes supply voltages of resources to optimize system-...