Sciweavers

1733 search results - page 116 / 347
» Digital data networks design using genetic algorithms
Sort
View
130
Voted
JCO
2010
101views more  JCO 2010»
15 years 2 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
142
Voted
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
16 years 4 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
15 years 7 months ago
Deceptiveness and neutrality the ND family of fitness landscapes
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...
William Beaudoin, Sébastien Vérel, P...
150
Voted
IPSN
2011
Springer
14 years 7 months ago
SpiderBat: Augmenting wireless sensor networks with distance and angle information
Having access to accurate position information is a key requirement for many wireless sensor network applications. We present the design, implementation and evaluation of SpiderBa...
Georg Oberholzer, Philipp Sommer, Roger Wattenhofe...
158
Voted
NDSS
2008
IEEE
15 years 10 months ago
Exploiting Opportunistic Scheduling in Cellular Data Networks
Third Generation (3G) cellular networks utilize timevarying and location-dependent channel conditions to provide broadband services. They employ opportunistic scheduling to effic...
Radmilo Racic, Denys Ma, Hao Chen, Xin Liu