837 search results - page 66 / 168 » Hard combinators |
CCECE
2006
IEEE
15 years 6 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
UIST
2006
ACM
15 years 5 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
VALUETOOLS
2006
ACM
15 years 5 months ago
2006
ACM
— Multi-server and multi-queue architectures are common mechanisms used in a large variety of applications (call centers, Web services, computer systems). One of the major motiva...
88
Voted
ATS
2005
IEEE
15 years 5 months ago
2005
IEEE
—Test application at reduced power supply voltage (low-voltage testing) or reduced temperature (low-temperature testing) can improve the defect coverage of a test set, particular...
DSN
2005
IEEE
15 years 5 months ago
2005
IEEE
View-oriented group communication is an important and widely used building block for constructing highlyavailable fault-tolerant systems. Unfortunately, groupcommunication based s...