8413 search results - page 383 / 1683 » Ordering Problem Subgoals |
174
click to vote
ICWE
2005
Springer
16 years 5 days ago
2005
Springer
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
183
click to vote
ICML
2004
IEEE
16 years 3 days ago
2004
IEEE
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
186
click to vote
EUROCRYPT
2004
Springer
16 years 1 days ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
141
Voted
IBERAMIA
2004
Springer
16 years 1 days ago
2004
Springer
In order to increase the role of machines in supporting more capabilities as regards a spoken dialogue system, we present in this paper a new problem incorporating multi-session in...
194
click to vote
PPSN
2004
Springer
16 years 15 hour ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...