3172 search results - page 47 / 635 » On the Random-Self-Reducibility of Complete Sets |
170
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
204
click to vote
PRL
2007
15 years 5 months ago
2007
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
186
click to vote
AIRWEB
2007
Springer
16 years 9 days ago
2007
Springer
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
168
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
163
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...