500 search results - page 88 / 100 » On the Hardness of Being Truthful |
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
119
click to vote
KBSE
1995
IEEE
15 years 3 months ago
1995
IEEE
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
111
click to vote
CP
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
106
click to vote
DEBS
2009
ACM
15 years 3 months ago
2009
ACM
Streaming data models have been shown to be useful in many applications requiring high-performance data exchange. Application-level overlay networks are a natural way to realize t...
115
click to vote
CASES
2008
ACM
15 years 1 months ago
2008
ACM
Detailed or cycle-accurate/bit-accurate (CABA) simulation is a critical phase in the design flow of embedded systems. However, with increasing system complexity, full detailed sim...