2925 search results - page 302 / 585 » Information Complexity of Online Problems |
185
click to vote
EPIA
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
164
click to vote
CAISE
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Recently, the database and AI research communities have paid increased attention to ontologies. The main motivating reason is that ontologies promise solutions for comple...
189
click to vote
INFORMS
2010
15 years 5 months ago
2010
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
198
click to vote
INFORMS
2010
15 years 5 months ago
2010
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
178
click to vote
ISR
2010
15 years 5 months ago
2010
One of the distinctive features of sites on the Internet is their ability to gather enormous amounts of information regarding their visitors, and use this information to enhance a...