Sciweavers

1568 search results - page 129 / 314
» The problem of examination questions in algorithmics
Sort
View
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 11 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 1 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 4 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
14 years 8 months ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
15 years 10 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener