796 search results - page 83 / 160 » Approximating the centroid is hard |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
CAV
2009
Springer
14 years 11 days ago
2009
Springer
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
ISAAC
2001
Springer
14 years 5 days ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...