838 search results - page 77 / 168 » Finding Optimal Solutions to Atomix |
160
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
164
Voted
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
157
click to vote
AAAI
2004
15 years 7 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
193
click to vote
DATAMINE
2010
15 years 6 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
145
click to vote
CANDC
2002
ACM
15 years 6 months ago
2002
ACM
To contribute to HCI investigation and interface design that develops interactive systems for creative solutions, I attempt to formulate a model of the human capability to combine...