5316 search results - page 72 / 1064 » Which Search Problems Are Random |
115
click to vote
IDA
1999
Springer
15 years 5 months ago
1999
Springer
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
78
Voted
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...
112
click to vote
SIGIR
2009
ACM
15 years 7 months ago
2009
ACM
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
108
click to vote
PPSN
2004
Springer
15 years 6 months 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...
108
click to vote
AI
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...