Sciweavers

65 search results - page 13 / 13
» Two Metaheuristics for Multiobjective Stochastic Combinatori...
Sort
View
CIBCB
2008
IEEE
13 years 11 months ago
Discovering novel cancer therapies: A computational modeling and search approach
— Solid tumors must recruit new blood vessels for growth and maintenance. Discovering drugs that block this tumor-induced development of new blood vessels (angiogenesis) is an im...
Arthur W. Mahoney, Brian G. Smith, Nicholas S. Fla...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 5 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
13 years 11 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 5 months ago
Extracting influential nodes on a social network for information diffusion
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...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
AAAI
2000
13 years 6 months ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier