849 search results - page 63 / 170 » On the Complexity of the Whitehead Minimization Problem |
CORR
2009
Springer
13 years 5 months ago
2009
Springer
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems...
EGPGV
2004
Springer
14 years 1 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
ACSC
2007
IEEE
14 years 2 months ago
2007
IEEE
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...