Sciweavers

1772 search results - page 90 / 355
» Classifying Problems into Complexity Classes
Sort
View
128
Voted
JSAT
2008
89views more  JSAT 2008»
15 years 2 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
Yury Chebiryak, Daniel Kroening
118
Voted
INFORMATICASI
2002
91views more  INFORMATICASI 2002»
15 years 2 months ago
Using Image Segmentation as a Basis for Categorization
Image categorization is the problem of classifying images into one or more of several possible categories or classes, which are defined in advance. Classifiers can be trained usin...
Janez Brank
165
Voted
CORR
2012
Springer
216views Education» more  CORR 2012»
13 years 10 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
115
Voted
CP
2007
Springer
15 years 8 months ago
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
Bart Peintner, Kristen Brent Venable, Neil Yorke-S...
ICALP
2007
Springer
15 years 8 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber