4377 search results - page 581 / 876 » Mass problems and randomness |
207
click to vote
IJCAI
2003
15 years 8 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
166
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
179
click to vote
AAAI
2000
15 years 8 months ago
2000
Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a ...
198
click to vote
ICGA
1997
15 years 8 months ago
1997
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
157
Voted
AAAI
2010
15 years 7 months ago
2010
Motivated by a real-world problem, we study a novel budgeted optimization problem where the goal is to optimize an unknown function f(x) given a budget. In our setting, it is not ...