Sciweavers

1054 search results - page 183 / 211
» Capacitated Domination Problem
Sort
View
142
Voted
CEC
2011
IEEE
14 years 1 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
138
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 1 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
102
Voted
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
15 years 10 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
117
Voted
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
15 years 7 months ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...
101
Voted
COMSWARE
2007
IEEE
15 years 7 months ago
VillageNet: A low-cost, 802.11-based mesh network for rural regions
— VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-s...
Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, ...