Sciweavers

356 search results - page 50 / 72
» Probabilistic Models for Expert Finding
Sort
View
BROADNETS
2006
IEEE
14 years 28 days ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...
WSC
2004
13 years 10 months ago
Data and Metadata Requirements for Composable Mission Space Environments
Composability is the capability to select and assemble reusable simulation components in various combinations into simulation systems to meet user requirements. The Defense Modeli...
Katherine L. Morse
MOBIHOC
2008
ACM
14 years 8 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
GECCO
2006
Springer
192views Optimization» more  GECCO 2006»
14 years 26 days ago
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
AIPS
2008
13 years 11 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan