465 search results - page 65 / 93 » On the Hardness of Range Assignment Problems |
113
click to vote
DSN
2003
IEEE
15 years 5 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
CSB
2004
IEEE
15 years 3 months ago
2004
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...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
WSC
2007
15 years 2 months ago
2007
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...
105
click to vote
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...