2593 search results - page 159 / 519 » On Two Problems of Nano-PLA Design |
102
click to vote
CONSTRAINTS
2007
14 years 10 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
GECCO
2011
Springer
14 years 2 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
SDM
2012
SIAM
13 years 1 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
118
click to vote
HICSS
2010
IEEE
15 years 5 months ago
2010
IEEE
Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two de...
ISCAS
2005
IEEE
15 years 4 months ago
2005
IEEE
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...