1041 search results - page 75 / 209 » Randomizing Reductions of Search Problems |
149
click to vote
EMO
2001
Springer
15 years 9 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
152
click to vote
SIGIR
2006
ACM
15 years 10 months ago
2006
ACM
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
172
click to vote
FSTTCS
1992
Springer
15 years 8 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
174
click to vote
EOR
2007
15 years 4 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
146
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...