Sciweavers

565 search results - page 103 / 113
» A Guided Monte Carlo Approach to Optimization Problems
Sort
View
DOCENG
2006
ACM
14 years 2 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
14 years 3 days ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
ATAL
2010
Springer
13 years 8 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 8 months ago
Fast Data Anonymization with Low Information Loss
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, ...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 1 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich