1225 search results - page 107 / 245 » The Instance Complexity Conjecture |
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
CP
2006
Springer
14 years 26 days ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
GECCO
2006
Springer
14 years 23 days ago
2006
Springer
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
COOPIS
1997
IEEE
14 years 21 days ago
1997
IEEE
Workflows are activities involving the coordinated execution of multiple tasks performed by different processing entities, mostly in distributed heterogeneous environments which a...
AIPS
2010
13 years 11 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...