2107 search results - page 78 / 422 » Computing Small Search Numbers in Linear Time |
108
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
154
click to vote
ENTCS
2006
15 years 3 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
142
click to vote
QSHINE
2005
IEEE
15 years 8 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
142
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
133
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...