3055 search results - page 342 / 611 » Randomized Search Trees |
102
Voted
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
114
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
133
Voted
AAAI
2000
15 years 5 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
130
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Individuals often use search engines to return to web pages they have previously visited. This behaviour, called refinding, accounts for about 38% of all queries. While researcher...
143
Voted
ISCI
2007
15 years 3 months ago
2007
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...