4553 search results - page 588 / 911 » Distributed Ranked Search |
153
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
148
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
This paper presents a semantic portal, SEMPort, which provides better user support with personalized views, semantic navigation, ontology-based search and three different kinds of...
137
click to vote
FCCM
2008
IEEE
15 years 10 months ago
2008
IEEE
Internet Protocol (IP) lookup in routers can be implemented by some form of tree traversal. Pipelining can dramatically improve the search throughput. However, it results in unbal...
125
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
120
click to vote
IAT
2007
IEEE
15 years 10 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...