Sciweavers

868 search results - page 49 / 174
» Finding Most Likely Solutions
Sort
View
HICSS
2003
IEEE
126views Biometrics» more  HICSS 2003»
14 years 1 months ago
E-Services in the Internet Job Market
In today’s rapidly changing workplace, it’s becoming more and more difficult for recruiters to find employees that are right for their business. Consideration of cultural fit,...
Georgios A. Dafoulas, Athanasios N. Nikolaou, Mike...
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 7 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...
APIN
2004
127views more  APIN 2004»
13 years 7 months ago
CLSS: An Intelligent Crane Lorry Scheduling System
Companies that provide crane-lorry services are faced with the daily need to perform vehicle and driver allocation and scheduling. Many companies still do this manually due to the ...
Hon Wai Chun, Rebecca Y. M. Wong
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
13 years 11 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
AIPS
2011
12 years 11 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...