Sciweavers

10848 search results - page 333 / 2170
» Programming in Biomolecular Computation
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 6 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ICPADS
1994
IEEE
15 years 11 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
ICPR
2004
IEEE
16 years 7 months ago
Segmentation and Classification of Meeting Events using Multiple Classifier Fusion and Dynamic Programming
In this paper the segmentation of a meeting into meeting events is investigated as well as the recognition of the detected segments. First the classification of a meeting event is...
Gerhard Rigoll, Stephan Reiter
SIBGRAPI
2008
IEEE
16 years 1 months ago
A Genetic Programming Approach for Relevance Feedback in Region-Based Image Retrieval Systems
This paper presents a new relevance feedback method for content-based image retrieval using local image features. This method adopts a genetic programming approach to learn user p...
Jefersson Alex dos Santos, Cristiano D. Ferreira, ...
FCT
2007
Springer
16 years 28 days ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...