Sciweavers

595 search results - page 76 / 119
» Incidence of
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
15 years 11 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
MICAI
2005
Springer
15 years 11 months ago
Modelling Human Intelligence: A Learning Mechanism
We propose a novel, high-level model of human learning and cognition, based on association forming. The model configures any input data stream featuring a high incidence of repeti...
Enrique Carlos Segura, Robin W. Whitty
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
15 years 11 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan
IEAAIE
2004
Springer
15 years 11 months ago
Modeling Intrusion Detection Systems Using Linear Genetic Programming Approach
This paper investigates the suitability of linear genetic programming (LGP) technique to model efficient intrusion detection systems, while comparing its performance with artificia...
Srinivas Mukkamala, Andrew H. Sung, Ajith Abraham
IWPEC
2004
Springer
15 years 11 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos