400 search results - page 42 / 80 » Hard Problem Generation for MKP |
106
Voted
KI
2001
Springer
15 years 5 months ago
2001
Springer
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
100
click to vote
ECRTS
2000
IEEE
15 years 5 months ago
2000
IEEE
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
104
click to vote
ASIACRYPT
2000
Springer
15 years 5 months ago
2000
Springer
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
130
click to vote
GECCO
2000
Springer
15 years 4 months ago
2000
Springer
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
75
Voted
AAAI
2008
15 years 3 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...