6036 search results - page 126 / 1208 » Web search solved |
104
click to vote
CSC
2008
15 years 2 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
108
Voted
ECOWS
2007
Springer
15 years 7 months ago
2007
Springer
The current Web service technology brought a new potential to the Web of services. However, the success of Web services still depends on resolving three fundamental challenges, na...
104
Voted
AIPS
2006
15 years 2 months ago
2006
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
132
click to vote
CN
1998
15 years 17 days ago
1998
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the...
87
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...