2877 search results - page 291 / 576 » The Complexity of Planarity Testing |
208
Voted
ICICIC
2006
IEEE
16 years 26 days ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
176
click to vote
IMSCCS
2006
IEEE
16 years 25 days ago
2006
IEEE
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
173
click to vote
ISCAS
2006
IEEE
16 years 25 days ago
2006
IEEE
— We describe an analog VLSI circuit implementing spike-driven synaptic plasticity, embedded in a network of integrate-and-fire neurons. This biologically inspired synapse is hi...
179
click to vote
LICS
2006
IEEE
16 years 25 days ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
162
click to vote
TRIDENTCOM
2006
IEEE
16 years 24 days ago
2006
IEEE
This paper describes the motivation, methodology and implementation approach of the testbed that has been developed in the framework of the EVEREST project. Such testbed is used f...