Sökresultat - "Polynomial time."

1

Satisfied with Satisfiability-A Note on the First NP-complete Problem av Vergara, John Paul C.

I publikationen Philippine computing journal

Artikel

2

On approximating the memory-Constrained Module Allocation Problem. av Roupin, Frederic

I publikationen Information processing letters.

Artikel

3

Succinct circuit representations and leaf language classes are basically the same concept. av Borchert, Bernd

I publikationen Information processing letters.

Artikel

4

On the nonenumerative path delay fault simulation problem. av Kagaris, D.

I publikationen IEEE Transactions on computer-aided design of integrated circuits and systems

Artikel

5

System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints. av Iyengar, V.

I publikationen IEEE Transactions on computer-aided design of integrated circuits and systems

Artikel

6

Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling. av Chabini, N.

I publikationen IEEE Transactions on VLSI systems

Artikel

7

Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization av Garillos, Cinmayii Abarsolo

Publicerad 2011

Lärdomsprov

8

Analysis of multipath routing, part 2 mitigation of the effects of frequently changing network topologies. av Tsirigos, A.

I publikationen IEEE Transactions on wireless communications

Artikel

9

Multiuser detection in CDMA - a comparison of relaxations, exact, and heuristic search methods. av Peng Hui Tan

I publikationen IEEE Transactions on wireless communications

Artikel

10

The problem of medium access control in wireless sensor networks. av Sagduyu, Y.E

I publikationen IEEE Wireless communications

Artikel

Sökresultat - "Polynomial time."

Satisfied with Satisfiability-A Note on the First NP-complete Problem av Vergara, John Paul C.

On approximating the memory-Constrained Module Allocation Problem. av Roupin, Frederic

Succinct circuit representations and leaf language classes are basically the same concept. av Borchert, Bernd

On the nonenumerative path delay fault simulation problem. av Kagaris, D.

System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints. av Iyengar, V.

Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling. av Chabini, N.

Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization av Garillos, Cinmayii Abarsolo

Analysis of multipath routing, part 2 mitigation of the effects of frequently changing network topologies. av Tsirigos, A.

Multiuser detection in CDMA - a comparison of relaxations, exact, and heuristic search methods. av Peng Hui Tan

The problem of medium access control in wireless sensor networks. av Sagduyu, Y.E

Sökverktyg:

Förfina resultatet

CAMPUS

DATABASE

UNIT LIBRARY

RESOURCE TYPE

YEAR OF PUBLICATION

CLASSIFICATION

SUBJECT

AUTHOR

LANGUAGE