Sciweavers

1568 search results - page 48 / 314
» The problem of examination questions in algorithmics
Sort
View
AI
2004
Springer
14 years 10 months ago
Version spaces and the consistency problem
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Mit82] proposed representing a version space by its boundary s...
Haym Hirsh, Nina Mishra, Leonard Pitt
CISS
2008
IEEE
15 years 4 months ago
Partial side information problem: Equivalence of two inner bounds
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
Soumya Jana, Richard E. Blahut
PPSN
2004
Springer
15 years 3 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
FOCI
2007
IEEE
15 years 4 months ago
On the Convergence of Immune Algorithms
Immune Algorithms have been used widely and successfully in many computational intelligence areas including optimization. Given the large number of variants of each operator of thi...
Vincenzo Cutello, Giuseppe Nicosia, Mario Romeo, P...
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
15 years 3 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...