1795 search results - page 292 / 359 » On the Complexity of Circuit Satisfiability |
GECCO
2000
Springer
14 years 1 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
KDD
2000
ACM
14 years 1 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
SIGGRAPH
1991
ACM
14 years 1 months ago
1991
ACM
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...
FASE
2010
Springer
14 years 1 months ago
2010
Springer
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
CAE
2007
14 years 11 days ago
2007
The visualization of color images in gray scale has high practical and theoretical importance. Neither the existing local, gradient based methods, nor the fast global techniques g...