2214 search results - page 265 / 443 » complexity 2004 |
126
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
121
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
Bayesian Model Averaging (BMA) is well known for improving predictive accuracy by averaging inferences over all models in the model space. However, Markov chain Monte Carlo (MCMC)...
155
click to vote
AMEC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
145
Voted
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a modified optimal control model of drug scheduling in cancer chemotherapy and a new adaptive elitist-population based genetic algorithm (AEGA) to solve it. Wo...
112
Voted
STACS
2004
Springer
15 years 10 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...