2657 search results - page 68 / 532 » On the complexity of hierarchical problem solving |
126
click to vote
EUROCRYPT
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
105
click to vote
COMPLEXITY
2010
14 years 11 months ago
2010
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
138
click to vote
HICSS
2003
IEEE
15 years 6 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
126
click to vote
COMPULOG
1999
Springer
15 years 5 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
113
click to vote
DAC
2008
ACM
16 years 2 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...