2446 search results - page 421 / 490 » Choiceless Polynomial Time |
ICLP
1997
Springer
13 years 12 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
HICSS
1994
IEEE
13 years 11 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...