9842 search results - page 320 / 1969 » Problem complexity |
178
click to vote
TOOLS
1999
IEEE
15 years 11 months ago
1999
IEEE
The evolution of software systems over many years often leads to unnecessarily complex and in exible designs which in turn lead to a huge amount of e ort for enhancements and main...
152
Voted
COCO
2008
Springer
15 years 8 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
163
click to vote
INFORMATICALT
2007
15 years 6 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
209
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
177
click to vote
ICRA
1999
IEEE
15 years 11 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...