3946 search results - page 671 / 790 » The computational complexity of choice sets |
197
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
181
click to vote
COMPSAC
1995
IEEE
15 years 10 months ago
1995
IEEE
Software development environments are examples of complex computer applications characterized by heterogeneity; they are composed of diverse information repositories, user interfa...
191
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
197
click to vote
LPNMR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
170
click to vote
RTCSA
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...