Sciweavers

4486 search results - page 373 / 898
» Adaptable Boundary Sets
Sort
View
211
Voted
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
15 years 11 months ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard
203
Voted
VTC
2007
IEEE
16 years 1 months ago
Interference Tolerance Signaling Using TDD Busy Tone Concept
Abstract—This paper presents a fully decentralized link adaptation algorithm to manage interference in an ad hoc network operating in TDD mode. The algorithm, called busy tone in...
Patrick Agyapong, Harald Haas, Alexander Tyrrell, ...
187
Voted
EUSFLAT
2007
150views Fuzzy Logic» more  EUSFLAT 2007»
15 years 9 months ago
Competitive Self-adaptation in Evolutionary Algorithms
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
Josef Tvrdík, Ivan Krivý
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 7 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 8 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar