4903 search results - page 49 / 981 » The Set Covering Machine |
133
Voted
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
147
Voted
ICCAD
1997
IEEE
15 years 6 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
132
Voted
AICCSA
2007
IEEE
15 years 9 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
131
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
125
Voted
IJCAI
2007
15 years 4 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...