4860 search results - page 204 / 972 » SNPs Problems, Complexity, and Algorithms |
121
click to vote
ICPP
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
138
click to vote
VLSID
1997
IEEE
15 years 7 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
AAAI
2004
15 years 4 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
105
click to vote
FLAIRS
2003
15 years 4 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
114
click to vote
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...